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 listJan 17, 2026 06:41Josu San MartinJosu San MartinScore: 129,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2026 06:41126,965649,193,916622,129,00002,281,472
2Jan 17, 2026 06:40126,994649,086,367621,270,0001,000,0002,347,008
3Jan 17, 2026 06:40127,028651,830,042620,437,0001,998,0002,281,472
4Jan 17, 2026 06:40127,041647,598,706619,502,0002,997,0002,281,472
5Jan 17, 2026 06:40127,044652,505,867620,517,0001,998,0002,281,472
6Jan 17, 2026 06:40127,050652,972,735619,550,0002,997,0002,281,472
7Jan 17, 2026 06:40129,106660,023,025629,619,0002,998,0002,281,472
8Jan 17, 2026 06:41129,493661,277,608631,519,0002,997,0002,359,296
9Jan 17, 2026 06:41129,497658,699,800631,540,0002,997,0002,281,472
10Jan 17, 2026 06:40129,500660,199,957634,548,00002,281,472
11Jan 17, 2026 06:40129,510664,445,726632,602,0001,998,0002,281,472
12Jan 17, 2026 06:40129,536663,188,949632,728,0001,999,0002,281,472