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 listJun 7, 2026 10:16Victor MerckléVictor MerckléScore: 54,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 10:1754,338275,359,330264,081,0002,176,0002,113,536
2Jun 7, 2026 10:1754,339275,331,276264,070,0002,192,0002,113,536
3Jun 7, 2026 10:1754,354276,066,635264,124,0002,211,0002,113,536
4Jun 7, 2026 10:1754,371275,526,208264,218,0002,201,0002,113,536
5Jun 7, 2026 10:1754,400275,734,009264,357,0002,203,0002,113,536
6Jun 7, 2026 10:1754,436275,960,120264,728,0002,011,0002,113,536
7Jun 7, 2026 10:1754,451276,092,930264,787,0002,025,0002,113,536
8Jun 7, 2026 10:1754,501276,225,702264,872,0002,187,0002,113,536
9Jun 7, 2026 10:1754,897278,112,004266,991,0002,007,0002,113,536