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 16, 2026 23:13Josu San MartinJosu San MartinScore: 162,910Success
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 00:33162,705823,301,813795,253,0002,000,0002,355,200
2Jan 17, 2026 00:33162,720822,007,342792,331,0004,995,0002,469,888
3Jan 16, 2026 23:13162,736828,702,018793,408,0003,997,0002,355,200
4Jan 17, 2026 00:33162,744826,555,224794,450,0002,997,0002,281,472
5Jan 16, 2026 23:13162,884822,917,719795,133,0003,000,0002,359,296
6Jan 16, 2026 23:13162,889819,509,252797,158,0001,000,0002,355,200
7Jan 16, 2026 23:13162,902824,444,583797,219,0001,000,0002,363,392
8Jan 17, 2026 00:33162,903830,043,804796,224,0002,000,0002,281,472
9Jan 17, 2026 00:33162,903829,013,318797,228,000999,0002,281,472
10Jan 17, 2026 00:33162,910824,105,701796,261,0002,000,0002,355,200
11Jan 17, 2026 00:33162,914826,097,990796,279,0001,998,0002,281,472
12Jan 16, 2026 23:13162,930827,086,347796,361,0001,998,0002,281,472
13Jan 16, 2026 23:13162,939826,419,919797,400,000999,0002,281,472
14Jan 16, 2026 23:13162,939825,799,289798,400,00002,351,104
15Jan 16, 2026 23:13162,939828,071,739794,405,0003,997,0002,281,472
16Jan 16, 2026 23:13163,071825,808,468799,048,00002,478,080
17Jan 17, 2026 00:33163,217826,212,944798,762,000999,0002,281,472
18Jan 17, 2026 00:33163,218823,729,569798,768,000999,0002,367,488