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 05:56Victor MerckléVictor MerckléScore: 26,825Success
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 05:5726,792139,699,219130,266,0001,018,0002,117,632stderr
2Sep 2, 2026 05:5726,798139,729,925130,260,0001,053,0002,117,632stderr
3Sep 2, 2026 05:5726,823139,865,123130,345,0001,092,0002,117,632stderr
4Sep 2, 2026 05:5726,824139,879,062130,337,0001,101,0002,117,632stderr
5Sep 2, 2026 05:5726,825141,022,036130,349,0001,094,0002,117,632stderr
6Sep 2, 2026 05:5726,831139,881,223130,392,0001,083,0002,117,632stderr
7Sep 2, 2026 05:5726,831139,898,753130,377,0001,097,0002,117,632stderr
8Sep 2, 2026 05:5726,832139,838,771130,388,0001,091,0002,117,632stderr
9Sep 2, 2026 05:5726,835139,896,235130,385,0001,109,0002,117,632stderr