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 listMay 11, 2026 16:13wnwnScore: 100,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 16:1499,953497,106,626488,769,0001,004,0002,113,536
2May 11, 2026 16:1499,957497,353,347487,780,0002,013,0002,113,536
3May 11, 2026 16:1499,978497,489,826487,890,0002,005,0002,113,536
4May 11, 2026 16:1499,996497,326,219488,979,0001,005,0002,113,536
5May 11, 2026 16:14100,016499,236,639489,077,0001,003,0002,113,536
6May 11, 2026 16:14100,030497,569,786489,145,0001,004,0002,113,536
7May 11, 2026 16:14100,063499,125,293489,307,0001,005,0002,113,536
8May 11, 2026 16:14100,120498,029,107488,564,0002,027,0002,113,536
9May 11, 2026 16:14100,285499,180,023490,394,0001,006,0002,113,536