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:06anboto1anboto1Score: 184,973Success
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:06184,788915,452,171904,385,0001,078,0002,113,536
2Jul 31, 2026 19:06184,869915,818,409904,676,0001,183,0002,113,536
3Jul 31, 2026 19:06184,876916,410,376903,704,0002,192,0002,113,536
4Jul 31, 2026 19:06184,943916,219,554905,149,0001,076,0002,113,536
5Jul 31, 2026 19:06184,973916,366,133905,141,0001,227,0002,113,536
6Jul 31, 2026 19:06185,049916,773,974905,657,0001,085,0002,113,536
7Jul 31, 2026 19:06185,072917,578,500905,764,0001,092,0002,113,536
8Jul 31, 2026 19:06185,126917,016,546906,050,0001,068,0002,113,536
9Jul 31, 2026 19:06185,137917,145,160906,091,0001,081,0002,113,536