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 listAug 3, 2026 05:26Josu San MartinJosu San MartinScore: 31,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 05:2631,204161,311,385151,628,0001,273,0002,113,536
2Aug 3, 2026 05:2631,214165,003,080151,673,0001,277,0002,113,536
3Aug 3, 2026 05:2631,214162,094,015151,688,0001,263,0002,113,536
4Aug 3, 2026 05:2631,214161,371,939151,685,0001,264,0002,113,536
5Aug 3, 2026 05:2631,220161,413,482151,721,0001,260,0002,113,536
6Aug 3, 2026 05:2631,221161,412,403151,714,0001,272,0002,113,536
7Aug 3, 2026 05:2631,235161,580,717152,040,0001,012,0002,113,536
8Aug 3, 2026 05:2631,244162,128,835151,818,0001,279,0002,113,536
9Aug 3, 2026 05:2631,245161,535,097152,080,0001,025,0002,113,536