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:15anboto1anboto1Score: 57,764Success
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:1557,536290,994,424280,831,0001,096,0002,113,536
2Aug 3, 2026 21:1557,544291,054,017280,876,0001,090,0002,113,536
3Aug 3, 2026 21:1557,569291,170,165280,930,0001,162,0002,113,536
4Aug 3, 2026 21:1557,571291,111,925281,009,0001,090,0002,113,536
5Aug 3, 2026 21:1557,764292,202,713281,920,0001,125,0002,113,536
6Aug 3, 2026 21:1557,940293,823,303282,889,0001,019,0002,113,536
7Aug 3, 2026 21:1557,987293,176,823283,055,0001,084,0002,113,536
8Aug 3, 2026 21:1558,058293,538,828283,373,0001,113,0002,113,536
9Aug 3, 2026 21:1558,908297,609,898287,521,0001,132,0002,113,536