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 02:10Victor MerckléVictor MerckléScore: 26,417Success
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 02:1126,382137,659,152128,239,0001,033,0002,117,632stderr
2Sep 2, 2026 02:1126,389137,723,821128,284,0001,024,0002,117,632stderr
3Sep 2, 2026 02:1126,396137,746,246128,321,0001,022,0002,117,632stderr
4Sep 2, 2026 02:1126,412138,998,430128,393,0001,027,0002,117,632stderr
5Sep 2, 2026 02:1126,417137,879,731128,406,0001,041,0002,117,632stderr
6Sep 2, 2026 02:1126,447138,256,807128,487,0001,108,0002,117,632stderr
7Sep 2, 2026 02:1126,453138,028,263128,529,0001,093,0002,117,632stderr
8Sep 2, 2026 02:1126,471138,152,801128,621,0001,091,0002,117,632stderr
9Sep 2, 2026 02:1126,501138,333,548128,728,0001,130,0002,117,632stderr