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 2, 2026 20:39Josu San MartinJosu San MartinScore: 29,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:3929,799156,057,940144,906,0001,112,0002,113,536
2Aug 2, 2026 20:3929,813156,100,589144,965,0001,120,0002,113,536
3Aug 2, 2026 20:3929,821156,184,884145,008,0001,117,0002,113,536
4Aug 2, 2026 20:3929,823156,192,071145,023,0001,113,0002,113,536
5Aug 2, 2026 20:3929,842156,328,298145,083,0001,144,0002,113,536
6Aug 2, 2026 20:3929,858156,377,727145,185,0001,122,0002,113,536
7Aug 2, 2026 20:3929,977157,651,715145,737,0001,153,0002,113,536
8Aug 2, 2026 20:3929,984156,985,427145,803,0001,120,0002,113,536
9Aug 2, 2026 20:3932,612170,618,972158,683,0001,116,0002,113,536