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 12, 2026 02:44Victor MerckléVictor MerckléScore: 52,997Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 02:4552,922268,448,446257,312,0002,009,0002,113,536
2Jun 12, 2026 02:4552,935268,475,227257,151,0002,234,0002,113,536
3Jun 12, 2026 02:4552,971268,592,188257,310,0002,248,0002,113,536
4Jun 12, 2026 02:4552,974268,660,488257,329,0002,247,0002,113,536
5Jun 12, 2026 02:4552,997268,864,430257,436,0002,250,0002,113,536
6Jun 12, 2026 02:4553,017268,812,839257,629,0002,157,0002,113,536
7Jun 12, 2026 02:4553,057269,109,957257,751,0002,232,0002,113,536
8Jun 12, 2026 02:4553,080269,153,545257,851,0002,242,0002,113,536
9Jun 12, 2026 02:4554,340275,345,975264,112,0002,154,0002,113,536