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 4, 2026 07:56Josu San MartinJosu San MartinScore: 26,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 07:5626,156137,225,612126,906,0001,259,0002,113,536
2Aug 4, 2026 07:5626,174137,346,777127,237,0001,016,0002,113,536
3Aug 4, 2026 07:5626,201137,532,703127,382,0001,003,0002,113,536
4Aug 4, 2026 07:5626,211137,625,869127,317,0001,117,0002,113,536
5Aug 4, 2026 07:5626,224137,565,892127,237,0001,265,0002,113,536
6Aug 4, 2026 07:5626,233137,713,565127,290,0001,253,0002,113,536
7Aug 4, 2026 07:5626,270142,046,513127,449,0001,274,0002,113,536
8Aug 4, 2026 07:5626,351138,599,172127,847,0001,276,0002,113,536
9Aug 4, 2026 07:5626,688139,858,204129,721,0001,051,0002,113,536