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:58zielajzielajScore: 30,578Success
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 04:0030,537157,694,691147,451,0002,181,0002,121,728stderr
2Jul 4, 2026 04:0030,547157,664,505147,486,0002,196,0002,121,728stderr
3Jul 4, 2026 04:0030,551157,737,174147,519,0002,185,0002,121,728stderr
4Jul 4, 2026 04:0030,560157,686,815147,606,0002,142,0002,121,728stderr
5Jul 4, 2026 04:0030,578157,924,364147,513,0002,322,0002,121,728stderr
6Jul 4, 2026 04:0030,720158,510,921148,382,0002,150,0002,121,728stderr
7Jul 4, 2026 04:0033,254170,923,458160,671,0002,278,0002,121,728stderr
8Jul 4, 2026 04:0037,727192,941,598182,749,0002,115,0002,121,728stderr
9Jul 4, 2026 04:0037,728192,970,251182,684,0002,185,0002,121,728stderr