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 listAug 25, 2026 12:24Victor MerckléVictor MerckléScore: 49,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 12:2549,074250,070,853239,367,0001,100,0002,117,632stderr
2Aug 25, 2026 12:2549,077248,647,062239,386,0001,095,0002,117,632stderr
3Aug 25, 2026 12:2549,085249,600,961239,391,0001,129,0002,117,632stderr
4Aug 25, 2026 12:2549,097248,885,398239,479,0001,100,0002,117,632stderr
5Aug 25, 2026 12:2549,098249,679,398239,469,0001,114,0002,117,632stderr
6Aug 25, 2026 12:2549,111248,916,708239,548,0001,096,0002,117,632stderr
7Aug 25, 2026 12:2549,111248,966,116239,521,0001,123,0002,117,632stderr
8Aug 25, 2026 12:2549,143248,928,548239,702,0001,100,0002,117,632stderr
9Aug 25, 2026 12:2549,212250,177,034240,138,0001,005,0002,117,632stderr