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 2, 2026 01:34Victor MerckléVictor MerckléScore: 26,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 01:3626,815139,789,115130,377,0001,017,0002,117,632stderr
2Sep 2, 2026 01:3626,898140,337,019130,644,0001,157,0002,117,632stderr
3Sep 2, 2026 01:3626,916140,322,951130,788,0001,104,0002,117,632stderr
4Sep 2, 2026 01:3626,929140,384,473130,861,0001,093,0002,117,632stderr
5Sep 2, 2026 01:3626,930140,428,458130,851,0001,107,0002,117,632stderr
6Sep 2, 2026 01:3626,949140,506,507130,970,0001,084,0002,117,632stderr
7Sep 2, 2026 01:3626,956140,568,830130,985,0001,103,0002,117,632stderr
8Sep 2, 2026 01:3626,957140,555,169130,990,0001,104,0002,117,632stderr
9Sep 2, 2026 01:3626,960142,622,183131,009,0001,097,0002,117,632stderr