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 listJul 3, 2026 06:36Victor MerckléVictor MerckléScore: 47,593Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 06:3747,556240,954,461230,992,0002,036,0002,117,632stderr
2Jul 3, 2026 06:3747,582241,033,916231,147,0002,007,0002,117,632stderr
3Jul 3, 2026 06:3747,592240,922,302231,188,0002,017,0002,117,632stderr
4Jul 3, 2026 06:3747,592241,124,490231,110,0002,094,0002,117,632stderr
5Jul 3, 2026 06:3747,593241,108,279231,178,0002,030,0002,117,632stderr
6Jul 3, 2026 06:3747,598241,107,469231,197,0002,035,0002,117,632stderr
7Jul 3, 2026 06:3747,702241,722,487231,731,0002,012,0002,117,632stderr
8Jul 3, 2026 06:3747,716241,771,587231,763,0002,047,0002,117,632stderr
9Jul 3, 2026 06:3748,012243,177,285233,175,0002,084,0002,117,632stderr