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 listMay 11, 2026 14:58Victor MerckléVictor MerckléScore: 96,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:0095,994479,193,290468,342,0002,033,0002,113,536
2May 11, 2026 15:0096,025480,751,833468,324,0002,199,0002,113,536
3May 11, 2026 15:0096,062480,344,089468,642,0002,066,0002,113,536
4May 11, 2026 15:0096,093481,573,056468,835,0002,023,0002,113,536
5May 11, 2026 15:0096,102480,787,912468,876,0002,025,0002,113,536
6May 11, 2026 15:0096,227480,357,600469,490,0002,026,0002,113,536
7May 11, 2026 15:0096,264482,323,099469,641,0002,057,0002,113,536
8May 11, 2026 15:0096,427481,374,843470,485,0002,008,0002,113,536
9May 11, 2026 15:0096,498481,849,787470,795,0002,049,0002,113,536