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:35anboto1anboto1Score: 57,629Success
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:3557,601291,179,893281,228,0001,021,0002,113,536
2Aug 3, 2026 21:3557,621291,486,325281,218,0001,125,0002,113,536
3Aug 3, 2026 21:3557,621290,755,992281,259,0001,085,0002,113,536
4Aug 3, 2026 21:3557,628290,892,321281,269,0001,112,0002,113,536
5Aug 3, 2026 21:3557,629291,440,011281,278,0001,107,0002,113,536
6Aug 3, 2026 21:3557,714291,876,302281,539,0001,264,0002,113,536
7Aug 3, 2026 21:3557,755292,804,356281,895,0001,105,0002,113,536
8Aug 3, 2026 21:3558,082293,637,109283,497,0001,105,0002,113,536
9Aug 3, 2026 21:3558,517295,802,626285,655,0001,081,0002,113,536