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 6, 2026 14:12Victor MerckléVictor MerckléScore: 33,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 14:1533,355171,447,562162,436,0001,007,0002,117,632stderr
2Jul 6, 2026 14:1533,410171,715,184162,707,0001,006,0002,117,632stderr
3Jul 6, 2026 14:1533,419171,803,955162,749,0001,006,0002,117,632stderr
4Jul 6, 2026 14:1533,445171,957,275162,875,0001,007,0002,117,632stderr
5Jul 6, 2026 14:1533,479172,038,847163,043,0001,005,0002,117,632stderr
6Jul 6, 2026 14:1533,499172,273,717163,140,0001,006,0002,117,632stderr
7Jul 6, 2026 14:1533,553172,462,085163,405,0001,007,0002,117,632stderr
8Jul 6, 2026 14:1533,656173,025,305162,765,0002,152,0002,117,632stderr
9Jul 6, 2026 14:1534,049174,881,366165,835,0001,006,0002,117,632stderr