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:58Victor MerckléVictor MerckléScore: 49,851Success
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:5949,749251,704,590241,742,0002,032,0002,117,632stderr
2Jul 3, 2026 06:5949,788252,008,339241,934,0002,029,0002,117,632stderr
3Jul 3, 2026 06:5949,809251,985,280242,057,0002,009,0002,117,632stderr
4Jul 3, 2026 06:5949,828252,108,625242,070,0002,092,0002,117,632stderr
5Jul 3, 2026 06:5949,851252,188,636242,224,0002,049,0002,117,632stderr
6Jul 3, 2026 06:5949,880252,101,251242,400,0002,015,0002,117,632stderr
7Jul 3, 2026 06:5949,885252,399,102242,418,0002,022,0002,117,632stderr
8Jul 3, 2026 06:5949,924252,537,835242,622,0002,009,0002,117,632stderr
9Jul 3, 2026 06:5950,248254,164,091244,173,0002,044,0002,117,632stderr