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 12:20Josu San MartinJosu San MartinScore: 35,177Success
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 12:2135,147182,357,670171,105,0001,119,0002,113,536
2Aug 2, 2026 12:2135,164182,281,451171,184,0001,124,0002,113,536
3Aug 2, 2026 12:2135,164183,130,564171,190,0001,114,0002,113,536
4Aug 2, 2026 12:2135,176182,389,686171,236,0001,129,0002,113,536
5Aug 2, 2026 12:2135,177182,420,287171,239,0001,133,0002,113,536
6Aug 2, 2026 12:2135,291182,931,830171,821,0001,107,0002,113,536
7Aug 2, 2026 12:2135,295183,185,833171,824,0001,122,0002,113,536
8Aug 2, 2026 12:2135,705184,980,313173,847,0001,111,0002,113,536
9Aug 2, 2026 12:2136,463188,640,558177,569,0001,100,0002,113,536