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 3, 2026 20:24anboto1anboto1Score: 58,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:2557,813292,388,300282,160,0001,124,0002,113,536
2Aug 3, 2026 20:2557,821292,554,966282,170,0001,156,0002,113,536
3Aug 3, 2026 20:2557,821292,308,238282,170,0001,154,0002,113,536
4Aug 3, 2026 20:2557,925292,868,406282,742,0001,091,0002,113,536
5Aug 3, 2026 20:2558,030292,790,322283,186,0001,163,0002,113,536
6Aug 3, 2026 20:2558,104295,250,920283,615,0001,098,0002,113,536
7Aug 3, 2026 20:2558,203294,358,687284,095,0001,104,0002,113,536
8Aug 3, 2026 20:2558,233294,564,580284,155,0001,190,0002,113,536
9Aug 3, 2026 20:2558,287294,030,624284,516,0001,092,0002,113,536