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 4, 2026 14:34Victor MerckléVictor MerckléScore: 46,223Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:3546,004233,278,107223,414,0002,010,0002,117,632stderr
2Jul 4, 2026 14:3546,008233,435,114223,406,0002,038,0002,117,632stderr
3Jul 4, 2026 14:3546,126234,057,882223,998,0002,020,0002,117,632stderr
4Jul 4, 2026 14:3546,138234,118,744224,040,0002,039,0002,117,632stderr
5Jul 4, 2026 14:3546,223234,951,494224,482,0002,013,0002,117,632stderr
6Jul 4, 2026 14:3546,390235,291,920225,303,0002,008,0002,117,632stderr
7Jul 4, 2026 14:3546,892237,811,267227,656,0002,119,0002,117,632stderr
8Jul 4, 2026 14:3546,972238,150,418228,120,0002,046,0002,117,632stderr
9Jul 4, 2026 14:3547,091240,512,755228,707,0002,042,0002,117,632stderr