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 2, 2026 15:45Josu San MartinJosu San MartinScore: 30,167Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 15:4529,877156,566,677145,269,0001,131,0002,113,536
2Aug 2, 2026 15:4529,884156,471,360145,329,0001,106,0002,113,536
3Aug 2, 2026 15:4530,155158,515,831146,635,0001,127,0002,113,536
4Aug 2, 2026 15:4530,161157,873,356146,673,0001,116,0002,113,536
5Aug 2, 2026 15:4530,167157,891,562146,703,0001,119,0002,113,536
6Aug 2, 2026 15:4530,183158,392,031146,750,0001,148,0002,113,536
7Aug 2, 2026 15:4530,201158,848,479146,860,0001,128,0002,113,536
8Aug 2, 2026 15:4530,202158,843,561146,854,0001,140,0002,113,536
9Aug 2, 2026 15:4530,260158,371,999147,163,0001,112,0002,113,536