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:42anboto1anboto1Score: 136,686Success
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:42135,614674,743,174663,104,0001,408,0002,113,536
2Jul 31, 2026 21:42135,697675,102,284663,544,0001,372,0002,113,536
3Jul 31, 2026 21:42136,065676,950,339665,364,0001,359,0002,113,536
4Jul 31, 2026 21:42136,349679,020,443666,699,0001,412,0002,113,536
5Jul 31, 2026 21:42136,686679,965,742668,401,0001,364,0002,113,536
6Jul 31, 2026 21:42136,848680,886,955668,525,0002,034,0002,113,536
7Jul 31, 2026 21:42137,648685,376,198673,100,0001,377,0002,113,536
8Jul 31, 2026 21:42138,140687,018,693675,507,0001,379,0002,113,536
9Jul 31, 2026 21:42139,068691,480,298680,082,0001,356,0002,113,536