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 00:55Josu San MartinJosu San MartinScore: 162,887Success
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:38162,739830,612,699796,420,000999,0002,359,296
2Jan 17, 2026 00:38162,741825,619,725794,434,0002,997,0002,281,472
3Jan 17, 2026 00:54162,741823,374,226794,436,0002,997,0002,351,104
4Jan 17, 2026 00:38162,742823,470,065794,438,0002,997,0002,281,472
5Jan 17, 2026 00:38162,742826,437,235794,439,0002,997,0002,289,664
6Jan 17, 2026 00:38162,743826,149,471793,446,0003,997,0002,355,200
7Jan 17, 2026 00:38162,755825,807,419792,502,0004,996,0002,281,472
8Jan 17, 2026 00:38162,887820,756,875798,144,00002,281,472
9Jan 17, 2026 00:54162,906830,481,450798,240,00002,359,296
10Jan 17, 2026 00:38162,912824,770,378796,269,0002,000,0002,273,280
11Jan 17, 2026 00:38162,935827,733,000797,383,000999,0002,359,296
12Jan 17, 2026 00:55163,008826,415,772794,743,0003,998,0002,281,472
13Jan 17, 2026 00:54163,060825,797,827796,995,0001,999,0002,359,296
14Jan 17, 2026 00:55163,078821,109,110797,083,0002,000,0002,281,472
15Jan 17, 2026 00:55163,380825,082,875797,562,0002,998,0002,281,472