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 1, 2026 00:34Victor MerckléVictor MerckléScore: 49,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 00:3549,387249,963,747239,978,0002,020,0002,117,632stderr
2Jul 1, 2026 00:3549,422250,051,687240,109,0002,059,0002,117,632stderr
3Jul 1, 2026 00:3549,440250,209,848240,156,0002,100,0002,117,632stderr
4Jul 1, 2026 00:3549,474250,278,696240,368,0002,059,0002,117,632stderr
5Jul 1, 2026 00:3549,482250,355,356240,402,0002,064,0002,117,632stderr
6Jul 1, 2026 00:3549,496250,443,952240,446,0002,088,0002,117,632stderr
7Jul 1, 2026 00:3549,536250,688,389240,705,0002,025,0002,117,632stderr
8Jul 1, 2026 00:3549,616251,022,704240,999,0002,122,0002,117,632stderr
9Jul 1, 2026 00:3549,877252,270,444242,282,0002,116,0002,117,632stderr