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 27, 2026 12:03Kevin HeaveyKevin HeaveyScore: 67,803Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 12:1067,480340,533,210320,820,0009,835,00020,480
2Jul 27, 2026 12:1067,611341,137,826320,170,00011,128,00020,480
3Jul 27, 2026 12:1067,731341,749,133321,128,00010,756,00020,480
4Jul 27, 2026 12:1067,757342,038,417322,122,0009,892,0002,113,536
5Jul 27, 2026 12:1067,803342,150,010320,887,00011,352,00020,480
6Jul 27, 2026 12:1067,902342,625,406320,855,00011,865,00020,480
7Jul 27, 2026 12:1067,952352,647,564321,256,00011,712,0002,113,536
8Jul 27, 2026 12:1068,013354,161,282321,045,00012,221,0002,113,536
9Jul 27, 2026 12:1068,317344,609,089321,741,00013,017,00020,480