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:37anboto1anboto1Score: 218,655Success
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:38217,2901,074,873,077955,230,000109,495,0002,113,536
2Jul 31, 2026 18:38217,5661,077,384,523955,675,000110,399,0002,113,536
3Jul 31, 2026 18:38218,1021,079,665,134959,741,000108,963,0002,113,536
4Jul 31, 2026 18:38218,5531,081,033,494960,855,000110,059,0002,113,536
5Jul 31, 2026 18:38218,6551,081,600,702961,461,000109,951,0002,113,536
6Jul 31, 2026 18:38218,9251,083,977,524962,465,000110,270,0002,113,536
7Jul 31, 2026 18:38219,6241,086,341,078965,898,000110,263,0002,113,536
8Jul 31, 2026 18:38219,9751,088,084,056967,865,000110,013,0002,113,536
9Jul 31, 2026 18:38220,1241,088,898,254968,290,000110,319,0002,113,536