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:07Victor MerckléVictor MerckléScore: 25,848Success
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:0825,832135,032,981125,535,0001,043,0002,117,632stderr
2Sep 2, 2026 10:0825,844134,916,862125,539,0001,097,0002,117,632stderr
3Sep 2, 2026 10:0825,845135,140,762125,546,0001,099,0002,117,632stderr
4Sep 2, 2026 10:0825,846135,061,737125,555,0001,092,0002,117,632stderr
5Sep 2, 2026 10:0825,848135,070,885125,546,0001,112,0002,117,632stderr
6Sep 2, 2026 10:0825,851135,116,159125,541,0001,132,0002,117,632stderr
7Sep 2, 2026 10:0825,853135,143,809125,557,0001,125,0002,117,632stderr
8Sep 2, 2026 10:0825,925143,344,078125,828,0001,209,0002,117,632stderr
9Sep 2, 2026 10:0825,958143,292,862126,035,0001,164,0002,117,632stderr