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 21:22anboto1anboto1Score: 57,609Success
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 21:2257,519290,435,381280,668,0001,177,0002,113,536
2Aug 3, 2026 21:2257,544290,451,280280,884,0001,086,0002,113,536
3Aug 3, 2026 21:2257,575291,182,030280,877,0001,245,0002,113,536
4Aug 3, 2026 21:2257,601291,407,093281,152,0001,094,0002,113,536
5Aug 3, 2026 21:2257,609290,789,038281,112,0001,173,0002,113,536
6Aug 3, 2026 21:2257,616291,329,573281,226,0001,093,0002,113,536
7Aug 3, 2026 21:2257,643291,639,755281,306,0001,148,0002,113,536
8Aug 3, 2026 21:2258,728296,845,598286,673,0001,099,0002,113,536
9Aug 3, 2026 21:2258,732296,805,705286,673,0001,117,0002,113,536