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:25anboto1anboto1Score: 57,710Success
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:2657,605290,850,679281,146,0001,119,0002,113,536
2Aug 3, 2026 20:2657,616291,429,273281,197,0001,124,0002,113,536
3Aug 3, 2026 20:2657,616291,417,230281,170,0001,153,0002,113,536
4Aug 3, 2026 20:2657,618291,396,830281,209,0001,120,0002,113,536
5Aug 3, 2026 20:2657,710291,263,498281,611,0001,170,0002,113,536
6Aug 3, 2026 20:2657,747291,363,064281,843,0001,118,0002,113,536
7Aug 3, 2026 20:2658,298294,427,638284,548,0001,115,0002,113,536
8Aug 3, 2026 20:2658,373294,997,446284,894,0001,137,0002,113,536
9Aug 3, 2026 20:2658,570295,659,322285,874,0001,120,0002,113,536