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 4, 2026 03:38zielajzielajScore: 27,357Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 03:3927,274141,647,077131,594,0002,053,0002,121,728stderr
2Jul 4, 2026 03:3927,276141,897,600131,638,0002,016,0002,121,728stderr
3Jul 4, 2026 03:3927,286141,688,727131,624,0002,079,0002,121,728stderr
4Jul 4, 2026 03:3927,309142,126,302131,758,0002,059,0002,121,728stderr
5Jul 4, 2026 03:3927,357142,129,083131,963,0002,089,0002,121,728stderr
6Jul 4, 2026 03:3927,359141,994,112132,036,0002,027,0002,121,728stderr
7Jul 4, 2026 03:3927,361142,014,440132,031,0002,041,0002,121,728stderr
8Jul 4, 2026 03:3927,541143,226,391132,940,0002,015,0002,121,728stderr
9Jul 4, 2026 03:3929,293151,610,069141,496,0002,044,0002,121,728stderr