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:29anboto1anboto1Score: 141,000Success
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:30140,636699,479,338686,681,0002,438,0002,113,536
2Jul 31, 2026 21:30140,687699,640,767688,006,0001,363,0002,113,536
3Jul 31, 2026 21:30140,807700,255,476688,577,0001,381,0002,113,536
4Jul 31, 2026 21:30140,977702,079,914689,422,0001,368,0002,113,536
5Jul 31, 2026 21:30141,000701,841,453688,850,0002,052,0002,113,536
6Jul 31, 2026 21:30142,773710,507,194698,224,0001,368,0002,113,536
7Jul 31, 2026 21:30143,266713,073,494699,923,0002,085,0002,113,536
8Jul 31, 2026 21:30143,448713,909,026700,517,0002,383,0002,113,536
9Jul 31, 2026 21:30143,769714,851,396703,102,0001,367,0002,113,536