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 listJun 7, 2026 10:45Victor MerckléVictor MerckléScore: 59,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 10:4559,153298,887,881287,665,0002,189,0002,113,536
2Jun 7, 2026 10:4559,322299,787,343288,455,0002,226,0002,113,536
3Jun 7, 2026 10:4559,355299,994,395288,833,0002,010,0002,113,536
4Jun 7, 2026 10:4559,358300,020,450288,825,0002,032,0002,113,536
5Jun 7, 2026 10:4559,362300,008,617288,649,0002,225,0002,113,536
6Jun 7, 2026 10:4559,370299,976,816288,906,0002,007,0002,113,536
7Jun 7, 2026 10:4559,927302,810,974291,637,0002,008,0002,113,536
8Jun 7, 2026 10:4559,990303,086,222291,941,0002,014,0002,113,536
9Jun 7, 2026 10:4560,078303,557,623292,376,0002,008,0002,113,536