Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listAug 15, 2026 20:26Tomislav TunkovicTomislav TunkovicScore: 29,774Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 20:2729,334152,859,809142,731,0001,010,00020,480
2Aug 15, 2026 20:2729,378152,339,208142,946,0001,009,00020,480
3Aug 15, 2026 20:2729,406152,524,541143,083,0001,008,00020,480
4Aug 15, 2026 20:2729,713154,775,438144,588,0001,009,00020,480
5Aug 15, 2026 20:2729,774154,982,557144,885,0001,009,00020,480
6Aug 15, 2026 20:2729,858154,787,950145,298,0001,010,00020,480
7Aug 15, 2026 20:2729,875154,756,678145,383,0001,009,00020,480
8Aug 15, 2026 20:2730,202157,118,637146,981,0001,011,00020,480
9Aug 15, 2026 20:2730,439157,521,141148,144,0001,010,00020,480