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 05:40Josu San MartinJosu San MartinScore: 181,057Success
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 05:40180,804911,851,256884,943,000999,0002,289,664
2Jan 17, 2026 05:40180,830912,015,877886,065,00002,289,664
3Jan 17, 2026 05:33180,996911,595,713884,880,0001,999,0002,326,528
4Jan 17, 2026 05:33181,055914,913,910887,168,00002,289,664
5Jan 17, 2026 05:40181,057918,818,998885,181,0001,998,0002,318,336
6Jan 17, 2026 05:40181,060919,126,312886,193,000999,0002,318,336
7Jan 17, 2026 05:33181,086916,893,111886,320,000999,0002,289,664
8Jan 17, 2026 05:40182,314921,075,426891,343,0001,998,0002,314,240
9Jan 17, 2026 05:40182,371921,887,766891,618,0001,999,0002,289,664