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 20:18anboto1anboto1Score: 57,977Success
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 20:1957,897294,302,753282,592,0001,105,0002,113,536
2Aug 3, 2026 20:1957,904292,808,911282,644,0001,087,0002,113,536
3Aug 3, 2026 20:1957,909292,373,140282,661,0001,094,0002,113,536
4Aug 3, 2026 20:1957,914292,835,836282,528,0001,255,0002,113,536
5Aug 3, 2026 20:1957,977293,159,112282,999,0001,089,0002,113,536
6Aug 3, 2026 20:1957,987293,305,766282,960,0001,181,0002,113,536
7Aug 3, 2026 20:1958,022293,308,551283,196,0001,116,0002,113,536
8Aug 3, 2026 20:1958,139293,434,133283,791,0001,092,0002,113,536
9Aug 3, 2026 20:1958,955297,478,595287,765,0001,115,0002,113,536