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 4, 2026 22:05Victor MerckléVictor MerckléScore: 48,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 22:0548,527245,706,430235,736,0002,047,0002,117,632stderr
2Jul 4, 2026 22:0548,628246,255,308236,234,0002,047,0002,117,632stderr
3Jul 4, 2026 22:0548,668246,436,912236,439,0002,038,0002,117,632stderr
4Jul 4, 2026 22:0548,678246,554,614236,503,0002,022,0002,117,632stderr
5Jul 4, 2026 22:0548,698246,564,333236,539,0002,082,0002,117,632stderr
6Jul 4, 2026 22:0548,744246,804,784236,837,0002,013,0002,117,632stderr
7Jul 4, 2026 22:0548,821247,142,210237,167,0002,059,0002,117,632stderr
8Jul 4, 2026 22:0548,824247,355,923237,144,0002,097,0002,117,632stderr
9Jul 4, 2026 22:0548,859247,381,013237,303,0002,109,0002,117,632stderr