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 listMar 15, 2026 08:50limanjun99limanjun99Score: 908,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 08:50908,4034,479,653,1804,449,178,0001,998,0002,285,568
2Mar 15, 2026 08:50908,5214,485,092,3834,448,755,0002,997,0002,269,184
3Mar 15, 2026 08:50908,5314,481,411,0354,448,803,0002,998,0002,281,472
4Mar 15, 2026 08:50908,5544,473,438,2504,449,914,0001,999,0002,281,472
5Mar 15, 2026 08:50908,6644,485,562,5644,448,458,0003,996,0002,281,472
6Mar 15, 2026 08:50908,7434,478,932,0444,447,844,0004,997,0002,260,992
7Mar 15, 2026 08:50920,0464,537,803,9594,505,226,0002,998,0002,281,472
8Mar 15, 2026 08:50922,0824,550,026,0624,515,204,0002,998,0002,281,472
9Mar 15, 2026 08:50922,5564,550,831,3144,517,524,0002,998,0002,273,280