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 listFeb 18, 2026 23:49Josu San MartinJosu San MartinScore: 83,834Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 23:4983,799437,690,036407,619,0002,997,0002,273,280
2Feb 18, 2026 23:4983,801438,834,315408,628,0001,998,0002,400,256
3Feb 18, 2026 23:4983,817441,202,848408,704,0001,998,0002,273,280
4Feb 18, 2026 23:4983,829442,119,074405,765,0004,997,0002,273,280
5Feb 18, 2026 23:4983,834434,963,325408,791,0001,998,0002,396,160
6Feb 18, 2026 23:4983,894437,192,736409,083,0002,000,0002,273,280
7Feb 18, 2026 23:4983,924441,090,564408,232,0002,994,0002,273,280
8Feb 18, 2026 23:4985,367446,195,315418,299,00002,273,280
9Feb 18, 2026 23:4985,369446,589,373416,306,0002,001,0002,400,256