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 28, 2026 21:38Josu San MartinJosu San MartinScore: 25,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 21:3825,081131,284,481121,647,0001,250,0002,113,536
2Aug 28, 2026 21:3825,105131,432,671121,754,0001,263,0002,113,536
3Aug 28, 2026 21:3825,120131,444,343121,838,0001,251,0002,113,536
4Aug 28, 2026 21:3825,125132,627,804122,098,0001,017,0002,113,536
5Aug 28, 2026 21:3825,127131,539,594121,855,0001,268,0002,113,536
6Aug 28, 2026 21:3825,131131,584,724121,900,0001,244,0002,113,536
7Aug 28, 2026 21:3825,150131,551,347122,062,0001,173,0002,113,536
8Aug 28, 2026 21:3825,169131,718,948122,063,0001,267,0002,113,536
9Aug 28, 2026 21:3830,191156,140,790146,928,0001,008,0002,113,536