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 2, 2026 18:17Victor MerckléVictor MerckléScore: 49,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 18:1749,736251,790,354241,682,0002,025,0002,117,632stderr
2Jul 2, 2026 18:1749,789251,924,866241,958,0002,012,0002,117,632stderr
3Jul 2, 2026 18:1749,798251,894,068241,967,0002,048,0002,117,632stderr
4Jul 2, 2026 18:1749,825251,904,488242,083,0002,062,0002,117,632stderr
5Jul 2, 2026 18:1749,832252,078,395242,166,0002,011,0002,117,632stderr
6Jul 2, 2026 18:1749,870252,715,394242,285,0002,079,0002,117,632stderr
7Jul 2, 2026 18:1749,872252,264,581242,356,0002,021,0002,117,632stderr
8Jul 2, 2026 18:1750,310254,488,147245,513,0001,006,0002,117,632stderr
9Jul 2, 2026 18:1750,625255,943,557246,044,0002,023,0002,117,632stderr