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 03:28Josu San MartinJosu San MartinScore: 29,043Success
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 03:2929,001150,606,335140,838,0001,269,0002,113,536
2Aug 3, 2026 03:2929,020151,353,879140,932,0001,267,0002,113,536
3Aug 3, 2026 03:2929,024150,645,292141,215,0001,006,0002,113,536
4Aug 3, 2026 03:2929,031151,449,228140,987,0001,267,0002,113,536
5Aug 3, 2026 03:2929,043151,439,425141,053,0001,258,0002,113,536
6Aug 3, 2026 03:2929,077151,471,341141,473,0001,006,0002,113,536
7Aug 3, 2026 03:2929,269152,628,423142,414,0001,008,0002,113,536
8Aug 3, 2026 03:2929,315152,764,068142,386,0001,262,0002,113,536
9Aug 3, 2026 03:2929,661154,376,197144,072,0001,270,0002,113,536