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 listSep 3, 2026 18:45Victor MerckléVictor MerckléScore: 25,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 18:4525,808134,845,415125,439,0001,025,0002,117,632stderr
2Sep 3, 2026 18:4525,854135,255,924125,584,0001,102,0002,117,632stderr
3Sep 3, 2026 18:4525,859137,399,066125,611,0001,100,0002,117,632stderr
4Sep 3, 2026 18:4525,862135,188,977125,582,0001,146,0002,117,632stderr
5Sep 3, 2026 18:4525,862135,191,187125,622,0001,102,0002,117,632stderr
6Sep 3, 2026 18:4525,863135,182,952125,637,0001,095,0002,117,632stderr
7Sep 3, 2026 18:4525,875135,880,431125,690,0001,102,0002,117,632stderr
8Sep 3, 2026 18:4525,884135,370,246125,700,0001,133,0002,117,632stderr
9Sep 3, 2026 18:4525,908135,407,101125,848,0001,102,0002,117,632stderr