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 listSep 3, 2026 21:16Victor MerckléVictor MerckléScore: 25,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 21:1725,670134,578,499124,762,0001,021,0002,117,632stderr
2Sep 3, 2026 21:1725,677134,283,515124,790,0001,030,0002,117,632stderr
3Sep 3, 2026 21:1725,684134,345,949124,762,0001,093,0002,117,632stderr
4Sep 3, 2026 21:1725,690134,286,882124,851,0001,030,0002,117,632stderr
5Sep 3, 2026 21:1725,694134,168,450124,809,0001,096,0002,117,632stderr
6Sep 3, 2026 21:1725,698134,371,750124,834,0001,091,0002,117,632stderr
7Sep 3, 2026 21:1725,703134,518,817124,841,0001,105,0002,117,632stderr
8Sep 3, 2026 21:1725,704135,077,444124,859,0001,092,0002,117,632stderr
9Sep 3, 2026 21:1725,980135,873,455125,056,0002,247,0002,117,632stderr