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 17:22Victor MerckléVictor MerckléScore: 25,889Success
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 17:2225,865135,196,249125,696,0001,047,0002,117,632stderr
2Sep 3, 2026 17:2225,873135,250,755125,756,0001,026,0002,117,632stderr
3Sep 3, 2026 17:2225,874135,228,441125,765,0001,019,0002,117,632stderr
4Sep 3, 2026 17:2225,884135,272,466125,741,0001,092,0002,117,632stderr
5Sep 3, 2026 17:2225,889135,285,421125,771,0001,089,0002,117,632stderr
6Sep 3, 2026 17:2225,892135,399,451125,767,0001,104,0002,117,632stderr
7Sep 3, 2026 17:2225,893135,364,578125,781,0001,099,0002,117,632stderr
8Sep 3, 2026 17:2225,894135,297,248125,793,0001,090,0002,117,632stderr
9Sep 3, 2026 17:2225,901135,456,349125,802,0001,114,0002,117,632stderr