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 18, 2026 01:22Josu San MartinJosu San MartinScore: 25,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 01:2725,149133,225,936122,121,0001,111,0002,113,536
2Aug 18, 2026 01:2725,200133,390,073122,449,0001,031,0002,113,536
3Aug 18, 2026 01:2725,211142,568,970122,529,0001,009,0002,113,536
4Aug 18, 2026 01:2725,241144,588,101122,658,0001,024,0002,113,536
5Aug 18, 2026 01:2725,260143,298,953122,619,0001,157,0002,113,536
6Aug 18, 2026 01:2725,577135,157,152124,211,0001,120,0002,113,536
7Aug 18, 2026 01:2727,588144,948,024134,073,0001,113,0002,113,536
8Aug 18, 2026 01:2727,620146,661,509134,205,0001,134,0002,113,536
9Aug 18, 2026 01:2730,241157,932,855147,080,0001,105,0002,113,536