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 23, 2026 02:10Josu San MartinJosu San MartinScore: 106,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2026 02:10106,482548,792,637517,765,0003,998,0002,363,392
2Jan 23, 2026 02:33106,482543,019,815519,764,0001,999,0002,359,296
3Jan 23, 2026 02:10106,484543,210,915518,774,0002,998,0002,359,296
4Jan 23, 2026 02:33106,509543,274,394519,893,0001,999,0002,269,184
5Jan 23, 2026 02:33106,517547,234,786520,936,000999,0002,269,184
6Jan 23, 2026 02:10106,527543,146,384519,982,0001,999,0002,367,488
7Jan 23, 2026 02:33106,528545,886,974519,990,0001,999,0002,367,488
8Jan 23, 2026 02:33106,531546,046,852517,004,0005,000,0002,371,584
9Jan 23, 2026 02:10106,538551,088,440522,035,00002,269,184
10Jan 23, 2026 02:33106,575554,611,423520,221,0001,997,0002,269,184
11Jan 23, 2026 02:33106,588546,677,955520,278,0002,001,0002,269,184
12Jan 23, 2026 02:10106,589553,317,329520,286,0002,001,0002,269,184
13Jan 23, 2026 02:10106,614552,452,710521,409,0001,000,0002,486,272
14Jan 23, 2026 02:10106,656553,474,088519,618,0002,997,0002,371,584
15Jan 23, 2026 02:10106,677551,207,724518,719,0003,997,0002,269,184
16Jan 23, 2026 02:33106,736544,168,340519,006,0004,000,0002,457,600
17Jan 23, 2026 02:33107,551549,677,334524,000,0003,000,0002,269,184
18Jan 23, 2026 02:10107,581548,974,570526,145,0001,000,0002,367,488