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 3, 2026 22:01Victor MerckléVictor MerckléScore: 25,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:0125,838135,064,810125,504,0001,107,0002,117,632stderr
2Sep 3, 2026 22:0125,841137,050,900125,510,0001,111,0002,117,632stderr
3Sep 3, 2026 22:0125,861135,238,077125,617,0001,102,0002,117,632stderr
4Sep 3, 2026 22:0125,868135,237,666125,660,0001,095,0002,117,632stderr
5Sep 3, 2026 22:0125,880135,995,521125,697,0001,117,0002,117,632stderr
6Sep 3, 2026 22:0125,881135,334,282125,590,0001,227,0002,117,632stderr
7Sep 3, 2026 22:0125,896135,881,114125,799,0001,094,0002,117,632stderr
8Sep 3, 2026 22:0125,902135,336,403125,813,0001,110,0002,117,632stderr
9Sep 3, 2026 22:0125,909135,474,078125,849,0001,107,0002,117,632stderr