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 18:10anboto1anboto1Score: 147,380Success
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 18:11147,062731,287,886719,521,0001,087,0002,113,536
2Jul 31, 2026 18:11147,192731,279,701720,164,0001,081,0002,113,536
3Jul 31, 2026 18:11147,352732,800,024720,932,0001,094,0002,113,536
4Jul 31, 2026 18:11147,367732,114,658721,013,0001,090,0002,113,536
5Jul 31, 2026 18:11147,380732,092,938721,087,0001,075,0002,113,536
6Jul 31, 2026 18:11147,409732,666,190721,220,0001,088,0002,113,536
7Jul 31, 2026 18:11147,425732,978,669721,304,0001,080,0002,113,536
8Jul 31, 2026 18:11147,459732,489,357721,463,0001,087,0002,113,536
9Jul 31, 2026 18:11147,663733,861,495722,472,0001,081,0002,113,536