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 3, 2026 14:44Victor MerckléVictor MerckléScore: 56,096Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 14:4556,039282,532,600272,567,0002,028,0002,117,632stderr
2Jul 3, 2026 14:4556,061283,057,120272,573,0002,129,0002,117,632stderr
3Jul 3, 2026 14:4556,065282,655,758272,643,0002,077,0002,117,632stderr
4Jul 3, 2026 14:4556,091282,805,849272,841,0002,007,0002,117,632stderr
5Jul 3, 2026 14:4556,096282,822,731272,848,0002,025,0002,117,632stderr
6Jul 3, 2026 14:4556,125282,968,216272,974,0002,042,0002,117,632stderr
7Jul 3, 2026 14:4556,152283,119,261272,977,0002,168,0002,117,632stderr
8Jul 3, 2026 14:4556,253283,636,014273,554,0002,089,0002,117,632stderr
9Jul 3, 2026 14:4558,458294,401,084284,389,0002,060,0002,117,632stderr