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 04:36Josu San MartinJosu San MartinScore: 153,013Success
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 04:18148,535753,086,255725,822,0001,999,0002,338,816
2Jan 17, 2026 04:36150,898765,944,347735,405,0003,996,0002,330,624
3Jan 17, 2026 04:36151,638771,707,686743,028,00002,281,472
4Jan 17, 2026 04:18152,288780,011,874745,209,0001,000,0002,334,720
5Jan 17, 2026 04:18152,425775,382,329742,884,0003,999,0002,281,472
6Jan 17, 2026 04:18152,595776,080,067744,717,0002,998,0002,334,720
7Jan 17, 2026 04:18152,702776,081,382744,238,0004,001,0002,281,472
8Jan 17, 2026 04:36152,748777,497,092746,465,0001,998,0002,281,472
9Jan 17, 2026 04:36152,952775,435,016747,466,0001,998,0002,281,472
10Jan 17, 2026 04:18153,013778,413,938748,767,000999,0002,334,720
11Jan 17, 2026 04:36153,089773,830,151749,136,0001,000,0002,281,472
12Jan 17, 2026 04:36153,151774,376,908750,438,00002,281,472
13Jan 17, 2026 04:18153,255775,463,883747,949,0002,999,0002,334,720
14Jan 17, 2026 04:18153,456782,166,773749,935,0001,999,0002,322,432
15Jan 17, 2026 04:36153,457778,237,266750,940,000999,0002,281,472
16Jan 17, 2026 04:36153,578781,129,367750,534,0001,998,0002,330,624
17Jan 17, 2026 04:18154,073782,557,004751,957,0002,999,0002,281,472
18Jan 17, 2026 04:36154,514779,208,750755,118,0002,000,0002,281,472