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 29, 2026 01:09Josu San MartinJosu San MartinScore: 24,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:1024,361128,255,565118,115,0001,257,0002,113,536
2Aug 29, 2026 01:1024,363128,415,714118,116,0001,265,0002,113,536
3Aug 29, 2026 01:1024,363128,345,111118,113,0001,266,0002,113,536
4Aug 29, 2026 01:1024,363128,328,231118,116,0001,267,0002,113,536
5Aug 29, 2026 01:1024,364127,875,688118,123,0001,265,0002,113,536
6Aug 29, 2026 01:1024,375128,416,422118,169,0001,270,0002,113,536
7Aug 29, 2026 01:1024,380128,461,477118,215,0001,250,0002,113,536
8Aug 29, 2026 01:1025,532133,500,726123,842,0001,269,0002,113,536
9Aug 29, 2026 01:1026,845140,522,994130,288,0001,255,0002,113,536