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 18:19Josu San MartinJosu San MartinScore: 30,926Success
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 18:2030,910161,496,450150,356,0001,107,0002,113,536
2Aug 2, 2026 18:2030,912162,223,952150,342,0001,127,0002,113,536
3Aug 2, 2026 18:2030,917162,324,456150,362,0001,135,0002,113,536
4Aug 2, 2026 18:2030,917161,539,524150,373,0001,124,0002,113,536
5Aug 2, 2026 18:2030,926162,272,961150,404,0001,136,0002,113,536
6Aug 2, 2026 18:2030,941162,460,289150,484,0001,130,0002,113,536
7Aug 2, 2026 18:2030,953162,434,836150,536,0001,134,0002,113,536
8Aug 2, 2026 18:2031,116163,205,277151,346,0001,125,0002,113,536
9Aug 2, 2026 18:2031,990167,023,630155,608,0001,146,0002,113,536