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:47anboto1anboto1Score: 57,904Success
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:4957,582291,240,756281,055,0001,097,0002,113,536
2Aug 3, 2026 21:4957,594291,349,064281,127,0001,088,0002,113,536
3Aug 3, 2026 21:4957,651290,940,748281,326,0001,165,0002,113,536
4Aug 3, 2026 21:4957,832291,838,505282,266,0001,115,0002,113,536
5Aug 3, 2026 21:4957,904292,779,840282,610,0001,121,0002,113,536
6Aug 3, 2026 21:4957,912291,966,794282,660,0001,112,0002,113,536
7Aug 3, 2026 21:4958,095295,135,237283,662,0001,008,0002,113,536
8Aug 3, 2026 21:4958,303294,164,328284,554,0001,133,0002,113,536
9Aug 3, 2026 21:4960,018302,250,639292,920,0001,172,0002,113,536