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 9, 2026 22:36Victor MerckléVictor MerckléScore: 30,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 22:3730,558157,855,798148,726,0001,012,0002,117,632stderr
2Jul 9, 2026 22:3730,606158,068,543148,964,0001,010,0002,117,632stderr
3Jul 9, 2026 22:3730,641158,136,398149,135,0001,008,0002,117,632stderr
4Jul 9, 2026 22:3730,680158,204,808148,305,0002,031,0002,117,632stderr
5Jul 9, 2026 22:3730,727158,718,271148,514,0002,052,0002,117,632stderr
6Jul 9, 2026 22:3730,992159,737,637150,853,0001,009,0002,117,632stderr
7Jul 9, 2026 22:3730,997159,908,701150,879,0001,008,0002,117,632stderr
8Jul 9, 2026 22:3731,135160,814,759151,553,0001,009,0002,117,632stderr
9Jul 9, 2026 22:3731,200160,965,880151,874,0001,009,0002,117,632stderr