diff --git a/tests/test_linkedlist.c b/tests/test_linkedlist.c
index 46fdedd..ba2c35c 100644
--- a/tests/test_linkedlist.c
+++ b/tests/test_linkedlist.c
@@ -30,9 +30,9 @@ char* get_bytes_f(long bytes, char* str) {
 }
 
 typedef struct test_data {
-    uint64_t data1;
-    uint64_t data2;
-    uint64_t data3;
+    uint8_t data1;
+    uint16_t data2;
+    uint32_t data3;
     uint64_t data4;
 
     ni_list_node link;
@@ -50,12 +50,12 @@ int main (void)
     size_t test_size = 10;
     for(size_t i = 0; i < test_size; i++) {
         test_data* t = malloc(sizeof(test_data));
-        printf("n = %d allocated data at %p...test_data.link at %p...\n", i, &t, &t->link);
+        printf("n = %ld allocated data at %p...test_data.link at %p...\n", i, (void*)t, (void*)&t->link);
 
-        t->data1 = rand() % UINT64_MAX;
-        t->data2 = rand() % UINT64_MAX;
-        t->data3 = rand() % UINT64_MAX;
-        t->data4 = rand() % UINT64_MAX;
+        t->data1 = (uint8_t)(rand() % UINT8_MAX);
+        t->data2 = (uint16_t)(rand() % UINT16_MAX);
+        t->data3 = (uint32_t)(rand() % UINT32_MAX);
+        t->data4 = (((uint64_t)(rand() % UINT32_MAX)) << 32 | (rand() %UINT32_MAX));
 
         // ensure our link points at nothing.
         t->link.next = NULL;
@@ -63,17 +63,17 @@ int main (void)
 
         ni_list__push_back(&data_instances, &(t->link));
 
-        printf("write: n = %d: %ld %ld %ld %ld \n\tnext: %p\n\tprev: %p\n",
-            i, t->data1, t->data2, t->data3, t->data4, t->link.next, t->link.prev);
+        printf("write: n = %ld: %d %d %d %ld \n\tnext: %p\n\tprev: %p\n",
+            i, t->data1, t->data2, t->data3, t->data4, (void*)t->link.next, (void*)t->link.prev);
     }
 
-    printf("Inserted %d count entries into test list...\n", data_instances.count);
+    printf("Inserted %ld count entries into test list...\n", data_instances.count);
 
     { // scope for access to iter and list
         size_t i = 0;
         NI_LIST__FOREACH(&data_instances) {
           test_data* t = NI_LIST_CONTAINER_OF(it, test_data, link);
-          printf("read: %d: %ld %ld %ld %ld \n\tnext: %p\n\tprev: %p\n",
+          printf("read: %ld: %d %d %d %ld \n\tnext: %p\n\tprev: %p\n",
             i, t->data1, t->data2, t->data3, t->data4, (void*)it->next, (void*)it->prev);
           i++; 
         }