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 10, 2026 03:41Victor MerckléVictor MerckléScore: 31,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 03:4131,098160,258,510151,377,0001,008,0002,117,632stderr
2Jul 10, 2026 03:4131,178160,833,043151,765,0001,008,0002,117,632stderr
3Jul 10, 2026 03:4131,328161,551,988152,502,0001,008,0002,117,632stderr
4Jul 10, 2026 03:4131,481162,127,298153,251,0001,008,0002,117,632stderr
5Jul 10, 2026 03:4131,496162,444,825153,323,0001,010,0002,117,632stderr
6Jul 10, 2026 03:4131,694163,451,065154,292,0001,010,0002,117,632stderr
7Jul 10, 2026 03:4131,953164,707,711155,564,0001,009,0002,117,632stderr
8Jul 10, 2026 03:4132,072165,020,907156,148,0001,009,0002,117,632stderr
9Jul 10, 2026 03:4132,081165,397,570156,190,0001,010,0002,117,632stderr