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 14:29limanjun99limanjun99Score: 177,017Success
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 14:29176,120885,496,727859,989,0002,999,0002,289,664
2Mar 15, 2026 14:29176,332883,660,834863,028,0001,000,0002,273,280
3Mar 15, 2026 14:29176,926890,026,533864,939,0001,999,0002,285,568
4Mar 15, 2026 14:29176,949892,646,832865,048,0002,000,0002,289,664
5Mar 15, 2026 14:29177,017900,878,770865,386,0001,998,0002,289,664
6Mar 15, 2026 14:29177,817900,776,793869,302,0002,000,0002,289,664
7Mar 15, 2026 14:29179,357907,904,510877,852,000999,0002,392,064
8Mar 15, 2026 14:29179,658905,209,780878,327,0001,998,0002,260,992
9Mar 15, 2026 14:29181,100910,675,588885,390,0001,998,0002,269,184