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 12:14Victor MerckléVictor MerckléScore: 61,880Success
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 12:1461,804310,826,915300,820,0002,022,0002,117,632stderr
2Jul 5, 2026 12:1461,810310,806,682300,844,0002,026,0002,117,632stderr
3Jul 5, 2026 12:1461,840311,077,592300,997,0002,021,0002,117,632stderr
4Jul 5, 2026 12:1461,851311,006,816301,064,0002,006,0002,117,632stderr
5Jul 5, 2026 12:1461,880312,073,564301,127,0002,088,0002,117,632stderr
6Jul 5, 2026 12:1462,062312,077,714301,962,0002,146,0002,117,632stderr
7Jul 5, 2026 12:1462,131312,431,114302,262,0002,182,0002,117,632stderr
8Jul 5, 2026 12:1462,557314,991,942304,523,0002,008,0002,117,632stderr
9Jul 5, 2026 12:1462,791315,653,333305,656,0002,021,0002,117,632stderr