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:54Victor MerckléVictor MerckléScore: 39,882Success
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:5539,227200,086,988191,206,0001,007,0002,117,632stderr
2Jul 8, 2026 14:5539,333201,047,647190,724,0002,009,0002,117,632stderr
3Jul 8, 2026 14:5539,397201,190,114192,043,0001,006,0002,117,632stderr
4Jul 8, 2026 14:5539,731202,595,888193,680,0001,006,0002,117,632stderr
5Jul 8, 2026 14:5539,882203,512,944193,402,0002,021,0002,117,632stderr
6Jul 8, 2026 14:5540,063204,470,510195,306,0001,006,0002,117,632stderr
7Jul 8, 2026 14:5540,372205,609,576196,819,0001,006,0002,117,632stderr
8Jul 8, 2026 14:5540,404206,083,508196,977,0001,006,0002,117,632stderr
9Jul 8, 2026 14:5540,466206,420,919197,280,0001,007,0002,117,632stderr