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 4, 2026 19:05Josu San MartinJosu San MartinScore: 25,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 19:0625,190131,881,941122,180,0001,255,0002,113,536
2Aug 4, 2026 19:0625,202132,042,917122,231,0001,262,0002,113,536
3Aug 4, 2026 19:0625,207131,919,497122,245,0001,270,0002,113,536
4Aug 4, 2026 19:0625,209132,655,202122,259,0001,268,0002,113,536
5Aug 4, 2026 19:0625,210131,970,678122,502,0001,027,0002,113,536
6Aug 4, 2026 19:0625,211132,523,857122,529,0001,008,0002,113,536
7Aug 4, 2026 19:0625,213132,546,483122,286,0001,260,0002,113,536
8Aug 4, 2026 19:0625,512133,994,372123,735,0001,277,0002,113,536
9Aug 4, 2026 19:0625,526133,261,823123,820,0001,261,0002,113,536