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 5, 2026 17:38Victor MerckléVictor MerckléScore: 46,048Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 17:3945,697231,899,592212,331,00011,587,0002,117,632stderr
2Jul 5, 2026 17:3945,736232,083,057212,744,00011,366,0002,117,632stderr
3Jul 5, 2026 17:3945,760231,985,252212,631,00011,593,00024,576stderr
4Jul 5, 2026 17:3945,801232,363,623213,188,00011,238,0002,117,632stderr
5Jul 5, 2026 17:3946,048233,638,772212,334,00013,306,00024,576stderr
6Jul 5, 2026 17:3946,116233,958,953212,190,00013,780,00024,576stderr
7Jul 5, 2026 17:3947,243239,312,723214,585,00016,908,00024,576stderr
8Jul 5, 2026 17:3947,311239,853,802214,123,00017,703,00024,576stderr
9Jul 5, 2026 17:3948,358245,080,376215,467,00021,490,00024,576stderr