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 16:28Josu San MartinJosu San MartinScore: 29,804Success
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 16:2929,771156,466,734144,758,0001,122,0002,113,536
2Aug 2, 2026 16:2929,784156,798,320144,804,0001,142,0002,113,536
3Aug 2, 2026 16:2929,786155,948,799144,851,0001,103,0002,113,536
4Aug 2, 2026 16:2929,794156,113,358144,866,0001,126,0002,113,536
5Aug 2, 2026 16:2929,804156,813,737144,904,0001,140,0002,113,536
6Aug 2, 2026 16:2929,808156,466,964144,941,0001,123,0002,113,536
7Aug 2, 2026 16:2929,825156,841,990145,002,0001,142,0002,113,536
8Aug 2, 2026 16:2930,100157,638,939146,352,0001,138,0002,113,536
9Aug 2, 2026 16:2930,123158,305,172146,465,0001,140,0002,113,536