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 5, 2026 11:12Josu San MartinJosu San MartinScore: 222,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 11:13222,5111,100,356,033980,500,000109,804,0002,113,536
2Aug 5, 2026 11:13222,5441,100,608,170980,420,000110,049,0002,113,536
3Aug 5, 2026 11:13222,5761,100,772,650980,419,000110,207,0002,113,536
4Aug 5, 2026 11:13222,5871,100,894,100980,534,000110,145,0002,113,536
5Aug 5, 2026 11:13222,6111,101,817,015980,337,000110,461,0002,113,536
6Aug 5, 2026 11:13222,6221,101,754,439980,345,000110,506,0002,113,536
7Aug 5, 2026 11:13222,6511,101,130,649980,295,000110,696,0002,113,536
8Aug 5, 2026 11:13222,7211,101,511,371980,547,000110,787,0002,113,536
9Aug 5, 2026 11:13222,7661,101,590,435980,451,000111,103,0002,113,536