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 2, 2026 10:27Victor MerckléVictor MerckléScore: 26,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 10:2926,495138,730,765128,801,0001,029,0002,117,632stderr
2Sep 2, 2026 10:2926,501139,560,368128,788,0001,069,0002,117,632stderr
3Sep 2, 2026 10:2926,513138,326,480128,826,0001,092,0002,117,632stderr
4Sep 2, 2026 10:2926,523139,062,579128,871,0001,096,0002,117,632stderr
5Sep 2, 2026 10:2926,525138,392,742128,874,0001,099,0002,117,632stderr
6Sep 2, 2026 10:2926,528138,839,928128,869,0001,121,0002,117,632stderr
7Sep 2, 2026 10:2926,532138,540,338128,908,0001,102,0002,117,632stderr
8Sep 2, 2026 10:2926,536138,450,554128,900,0001,128,0002,117,632stderr
9Sep 2, 2026 10:2926,538138,785,103128,938,0001,103,0002,117,632stderr