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 listJul 31, 2026 19:26anboto1anboto1Score: 150,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 19:27149,990745,343,230732,614,0002,337,0002,113,536
2Jul 31, 2026 19:27149,991744,922,898733,577,0001,381,0002,117,632
3Jul 31, 2026 19:27150,000745,032,909733,661,0001,343,0002,113,536
4Jul 31, 2026 19:27150,023745,096,621733,704,0001,413,0002,113,536
5Jul 31, 2026 19:27150,140745,617,860734,350,0001,337,0002,113,536
6Jul 31, 2026 19:27150,151745,795,625734,422,0001,318,0002,113,536
7Jul 31, 2026 19:27150,251746,197,093734,907,0001,324,0002,113,536
8Jul 31, 2026 19:27150,277746,472,707735,008,0001,350,0002,113,536
9Jul 31, 2026 19:27150,380746,775,307735,530,0001,335,0002,113,536