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 3, 2026 21:57Victor MerckléVictor MerckléScore: 25,272Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 21:5825,229132,134,464122,596,0001,028,0002,117,632stderr
2Sep 3, 2026 21:5825,248132,578,793122,603,0001,116,0002,117,632stderr
3Sep 3, 2026 21:5825,268132,294,657122,712,0001,105,0002,117,632stderr
4Sep 3, 2026 21:5825,269132,234,620122,736,0001,085,0002,117,632stderr
5Sep 3, 2026 21:5825,272132,587,096122,713,0001,123,0002,117,632stderr
6Sep 3, 2026 21:5825,273132,298,979122,742,0001,099,0002,117,632stderr
7Sep 3, 2026 21:5825,275133,033,749122,760,0001,092,0002,117,632stderr
8Sep 3, 2026 21:5825,277132,433,278122,764,0001,097,0002,117,632stderr
9Sep 3, 2026 21:5825,289132,333,895122,823,0001,097,0002,117,632stderr