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 listSep 4, 2026 09:29Victor MerckléVictor MerckléScore: 25,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 09:3025,058131,057,183121,760,0001,025,0002,117,632stderr
2Sep 4, 2026 09:3025,094131,409,725121,859,0001,104,0002,117,632stderr
3Sep 4, 2026 09:3025,094131,431,787121,868,0001,095,0002,117,632stderr
4Sep 4, 2026 09:3025,097131,348,947121,878,0001,099,0002,117,632stderr
5Sep 4, 2026 09:3025,101131,455,273121,883,0001,113,0002,117,632stderr
6Sep 4, 2026 09:3025,103131,446,461121,901,0001,105,0002,117,632stderr
7Sep 4, 2026 09:3025,106133,085,423121,924,0001,096,0002,117,632stderr
8Sep 4, 2026 09:3025,110131,465,280121,944,0001,099,0002,117,632stderr
9Sep 4, 2026 09:3025,127131,629,801121,970,0001,157,0002,117,632stderr