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 21:12anboto1anboto1Score: 153,895Success
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 21:13151,605752,960,239741,689,0001,177,0002,113,536
2Jul 31, 2026 21:13152,452756,998,392745,840,0001,176,0002,113,536
3Jul 31, 2026 21:13152,985759,693,407748,415,0001,212,0002,113,536
4Jul 31, 2026 21:13153,654762,908,755751,676,0001,232,0002,113,536
5Jul 31, 2026 21:13153,895764,953,558752,882,0001,204,0002,113,536
6Jul 31, 2026 21:13154,067765,659,148753,754,0001,178,0002,113,536
7Jul 31, 2026 21:13155,018769,563,341758,405,0001,186,0002,113,536
8Jul 31, 2026 21:13156,000774,436,987763,205,0001,195,0002,113,536
9Jul 31, 2026 21:13157,019779,481,653768,225,0001,171,0002,113,536