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 listAug 3, 2026 21:25anboto1anboto1Score: 57,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:2657,542291,071,953280,853,0001,103,0002,113,536
2Aug 3, 2026 21:2657,568291,235,587280,996,0001,088,0002,113,536
3Aug 3, 2026 21:2657,595291,397,027281,119,0001,101,0002,113,536
4Aug 3, 2026 21:2657,608291,438,209281,126,0001,154,0002,113,536
5Aug 3, 2026 21:2657,686291,128,334281,557,0001,105,0002,113,536
6Aug 3, 2026 21:2657,703291,691,653281,654,0001,092,0002,113,536
7Aug 3, 2026 21:2657,963293,092,905282,826,0001,195,0002,113,536
8Aug 3, 2026 21:2658,477295,680,422285,437,0001,103,0002,113,536
9Aug 3, 2026 21:2659,110299,437,316288,549,0001,093,0002,113,536