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 3, 2026 20:48anboto1anboto1Score: 58,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:5057,753291,422,441281,770,0001,221,0002,113,536
2Aug 3, 2026 20:5057,755291,599,834281,794,0001,210,0002,113,536
3Aug 3, 2026 20:5058,003292,752,899283,099,0001,120,0002,113,536
4Aug 3, 2026 20:5058,010293,303,770283,117,0001,134,0002,113,536
5Aug 3, 2026 20:5058,033293,437,960283,316,0001,049,0002,113,536
6Aug 3, 2026 20:5058,316294,868,509284,745,0001,007,0002,113,536
7Aug 3, 2026 20:5058,450295,574,704285,187,0001,219,0002,113,536
8Aug 3, 2026 20:5058,458294,658,362285,327,0001,121,0002,113,536
9Aug 3, 2026 20:5058,468295,059,847285,306,0001,190,0002,113,536