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 listJul 4, 2026 03:55zielajzielajScore: 24,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 03:5624,378127,793,376117,423,0002,032,0002,121,728stderr
2Jul 4, 2026 03:5624,408127,981,971117,557,0002,045,0002,121,728stderr
3Jul 4, 2026 03:5624,424127,679,120117,600,0002,080,0002,121,728stderr
4Jul 4, 2026 03:5624,479127,878,325117,914,0002,037,0002,121,728stderr
5Jul 4, 2026 03:5624,524128,146,046118,106,0002,063,0002,121,728stderr
6Jul 4, 2026 03:5624,908130,038,103119,959,0002,093,0002,121,728stderr
7Jul 4, 2026 03:5624,914129,980,867119,997,0002,085,0002,121,728stderr
8Jul 4, 2026 03:5625,905135,100,620124,860,0002,076,0002,121,728stderr
9Jul 4, 2026 03:5626,178136,305,616126,220,0002,053,0002,121,728stderr