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 8, 2026 14:48Victor MerckléVictor MerckléScore: 33,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 14:4932,780168,467,158158,617,0002,006,0002,117,632stderr
2Jul 8, 2026 14:4932,804168,585,944159,731,0001,009,0002,117,632stderr
3Jul 8, 2026 14:4932,873168,951,823160,071,0001,010,0002,117,632stderr
4Jul 8, 2026 14:4933,023171,159,198159,763,0002,051,0002,117,632stderr
5Jul 8, 2026 14:4933,045169,764,715160,910,0001,012,0002,117,632stderr
6Jul 8, 2026 14:4933,083170,060,500161,103,0001,007,0002,117,632stderr
7Jul 8, 2026 14:4933,131170,248,062160,264,0002,079,0002,117,632stderr
8Jul 8, 2026 14:4933,208170,654,400160,716,0002,008,0002,117,632stderr
9Jul 8, 2026 14:4933,271171,153,081160,972,0002,058,0002,117,632stderr