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 3, 2026 19:50Victor MerckléVictor MerckléScore: 47,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 19:5147,575241,190,346231,087,0002,032,0002,117,632stderr
2Jul 3, 2026 19:5147,582241,459,209231,110,0002,043,0002,117,632stderr
3Jul 3, 2026 19:5147,595241,142,226232,214,0001,006,0002,117,632stderr
4Jul 3, 2026 19:5147,609241,007,930231,259,0002,027,0002,117,632stderr
5Jul 3, 2026 19:5147,617241,253,159231,299,0002,026,0002,117,632stderr
6Jul 3, 2026 19:5147,620241,293,444231,278,0002,060,0002,117,632stderr
7Jul 3, 2026 19:5147,633241,322,611231,383,0002,020,0002,117,632stderr
8Jul 3, 2026 19:5147,639241,384,115231,417,0002,017,0002,117,632stderr
9Jul 3, 2026 19:5148,219244,656,076234,221,0002,055,0002,117,632stderr