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 16, 2026 23:01Tomislav TunkovicTomislav TunkovicScore: 66,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 02:0766,034333,119,817322,562,0001,006,00020,480
2Aug 17, 2026 02:0766,145333,639,763322,077,0002,036,00020,480
3Aug 17, 2026 02:0766,231332,525,487322,526,0002,010,00020,480
4Aug 17, 2026 02:0766,480333,981,524324,750,0001,005,00020,480
5Aug 17, 2026 02:0766,614334,750,593325,409,0001,004,00020,480
6Aug 17, 2026 02:0766,624336,512,902324,424,0002,034,00020,480
7Aug 17, 2026 02:0767,090338,260,132327,732,0001,009,00020,480
8Aug 17, 2026 02:0767,121337,136,891327,889,0001,004,00020,480
9Aug 17, 2026 02:0768,332343,130,656333,822,0001,006,00020,480