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:00anboto1anboto1Score: 57,724Success
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:0257,673291,473,728281,511,0001,091,0002,113,536
2Aug 3, 2026 21:0257,678291,706,355281,530,0001,095,0002,113,536
3Aug 3, 2026 21:0257,692291,201,692281,551,0001,143,0002,113,536
4Aug 3, 2026 21:0257,700299,660,232281,597,0001,134,0002,113,536
5Aug 3, 2026 21:0257,724291,936,421281,742,0001,106,0002,113,536
6Aug 3, 2026 21:0257,765292,091,108281,879,0001,171,0002,113,536
7Aug 3, 2026 21:0257,945293,012,964282,811,0001,121,0002,113,536
8Aug 3, 2026 21:0257,992293,175,071283,073,0001,092,0002,113,536
9Aug 3, 2026 21:0258,112293,908,735283,585,0001,164,0002,113,536