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 4, 2026 19:44Josu San MartinJosu San MartinScore: 25,247Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 19:4425,176132,443,562122,110,0001,255,0002,113,536
2Aug 4, 2026 19:4425,204132,634,022122,222,0001,278,0002,113,536
3Aug 4, 2026 19:4425,212132,674,242122,513,0001,030,0002,113,536
4Aug 4, 2026 19:4425,227131,994,463122,356,0001,257,0002,113,536
5Aug 4, 2026 19:4425,247132,237,873122,452,0001,263,0002,113,536
6Aug 4, 2026 19:4425,290132,416,238122,909,0001,016,0002,113,536
7Aug 4, 2026 19:4425,311133,581,639122,775,0001,249,0002,113,536
8Aug 4, 2026 19:4425,932136,031,550125,813,0001,255,0002,113,536
9Aug 4, 2026 19:4426,696139,817,564129,560,0001,251,0002,113,536