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 13, 2026 19:24Tomislav TunkovicTomislav TunkovicScore: 529,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 19:30528,3842,597,649,6082,588,061,0001,022,0002,121,728stderr
2Aug 13, 2026 19:30528,6002,599,412,8082,589,134,0001,008,0002,121,728stderr
3Aug 13, 2026 19:30529,1702,601,679,4722,591,936,0001,001,0002,121,728stderr
4Aug 13, 2026 19:30529,2342,601,839,0232,592,245,0001,003,0002,121,728stderr
5Aug 13, 2026 19:30529,7222,604,023,4392,594,638,0001,004,0002,121,728stderr
6Aug 13, 2026 19:30530,1392,606,013,3932,596,683,0001,000,0002,121,728stderr
7Aug 13, 2026 19:30530,4012,607,312,9492,597,964,0001,001,0002,121,728stderr
8Aug 13, 2026 19:30535,2332,639,973,5232,621,630,0001,013,0002,121,728stderr
9Aug 13, 2026 19:30535,5412,632,834,4152,623,145,0001,008,0002,121,728stderr