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 06:51Victor MerckléVictor MerckléScore: 50,401Success
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 06:5250,340254,578,462244,642,0002,027,0002,117,632stderr
2Jul 3, 2026 06:5250,349254,680,427244,657,0002,057,0002,117,632stderr
3Jul 3, 2026 06:5250,379254,900,120244,833,0002,028,0002,117,632stderr
4Jul 3, 2026 06:5250,390254,832,326244,831,0002,082,0002,117,632stderr
5Jul 3, 2026 06:5250,401254,960,281244,806,0002,161,0002,117,632stderr
6Jul 3, 2026 06:5250,422254,949,688245,052,0002,016,0002,117,632stderr
7Jul 3, 2026 06:5250,785256,794,245246,810,0002,040,0002,117,632stderr
8Jul 3, 2026 06:5251,443259,971,597250,036,0002,038,0002,117,632stderr
9Jul 3, 2026 06:5251,771261,568,222251,640,0002,041,0002,117,632stderr