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 14:03Victor MerckléVictor MerckléScore: 25,860Success
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 14:0325,840135,064,168125,472,0001,145,0002,117,632stderr
2Sep 2, 2026 14:0325,841135,720,688125,523,0001,100,0002,117,632stderr
3Sep 2, 2026 14:0325,848135,124,735125,567,0001,093,0002,117,632stderr
4Sep 2, 2026 14:0325,855135,160,508125,593,0001,099,0002,117,632stderr
5Sep 2, 2026 14:0325,860135,165,559125,624,0001,091,0002,117,632stderr
6Sep 2, 2026 14:0325,864135,179,256125,638,0001,099,0002,117,632stderr
7Sep 2, 2026 14:0325,865135,157,342125,557,0001,183,0002,117,632stderr
8Sep 2, 2026 14:0325,867135,169,594125,660,0001,092,0002,117,632stderr
9Sep 2, 2026 14:0325,867136,419,628125,649,0001,102,0002,117,632stderr