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 13:07Tomislav TunkovicTomislav TunkovicScore: 36,145Success
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 13:0835,986184,532,157173,298,0003,034,0002,121,728stderr
2Aug 15, 2026 13:0835,997184,545,753173,362,0003,027,0002,121,728stderr
3Aug 15, 2026 13:0836,112185,128,017173,931,0003,020,0002,121,728stderr
4Aug 15, 2026 13:0836,117185,294,789173,954,0003,023,0002,121,728stderr
5Aug 15, 2026 13:0836,145185,433,785174,113,0003,000,0002,121,728stderr
6Aug 15, 2026 13:0836,206187,263,902174,352,0003,058,0002,121,728stderr
7Aug 15, 2026 13:0836,216185,712,224174,426,0003,035,0002,121,728stderr
8Aug 15, 2026 13:0836,257185,943,946174,637,0003,023,0002,121,728stderr
9Aug 15, 2026 13:0837,338191,260,234179,894,0003,063,0002,121,728stderr