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:36anboto1anboto1Score: 57,624Success
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:3757,561291,152,004280,953,0001,099,0002,113,536
2Aug 3, 2026 20:3757,566290,526,451280,980,0001,096,0002,113,536
3Aug 3, 2026 20:3757,573295,500,918280,927,0001,182,0002,113,536
4Aug 3, 2026 20:3757,603290,853,509281,149,0001,108,0002,113,536
5Aug 3, 2026 20:3757,624291,455,110281,233,0001,127,0002,113,536
6Aug 3, 2026 20:3757,646291,556,018281,304,0001,165,0002,113,536
7Aug 3, 2026 20:3757,703291,817,640281,636,0001,112,0002,113,536
8Aug 3, 2026 20:3758,483295,661,013285,479,0001,091,0002,113,536
9Aug 3, 2026 20:3758,671296,503,208286,401,0001,087,0002,113,536