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 01:00Josu San MartinJosu San MartinScore: 160,952Success
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 01:00160,937814,876,578786,591,0001,998,0002,355,200
2Jan 17, 2026 01:00160,937815,907,389788,591,00002,531,328
3Jan 17, 2026 01:00160,949820,158,730785,650,0002,998,0002,371,584
4Jan 17, 2026 01:00160,950816,210,795786,654,0001,999,0002,371,584
5Jan 17, 2026 01:00160,952816,762,685786,667,0001,999,0002,359,296
6Jan 17, 2026 01:00160,959818,077,378784,701,0003,998,0002,359,296
7Jan 17, 2026 01:00160,963814,944,125784,722,0003,998,0002,371,584
8Jan 17, 2026 01:00161,176818,377,096787,765,0001,999,0002,355,200
9Jan 17, 2026 01:00161,184813,034,199787,801,0001,999,0002,404,352