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:01anboto1anboto1Score: 57,932Success
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:0357,685291,147,873281,557,0001,104,0002,113,536
2Aug 3, 2026 21:0357,750291,463,489281,893,0001,083,0002,113,536
3Aug 3, 2026 21:0357,758291,450,735281,929,0001,087,0002,113,536
4Aug 3, 2026 21:0357,801292,171,803282,190,0001,037,0002,113,536
5Aug 3, 2026 21:0357,932292,258,892282,787,0001,083,0002,113,536
6Aug 3, 2026 21:0357,952292,378,010282,884,0001,084,0002,113,536
7Aug 3, 2026 21:0358,013292,678,002283,162,0001,106,0002,113,536
8Aug 3, 2026 21:0358,911297,115,763287,565,0001,099,0002,113,536
9Aug 3, 2026 21:0358,924297,774,956287,634,0001,094,0002,113,536