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 1, 2026 13:20Josu San MartinJosu San MartinScore: 41,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 13:2141,401212,844,433201,758,0001,109,0002,113,536
2Aug 1, 2026 13:2141,428213,111,533201,889,0001,113,0002,113,536
3Aug 1, 2026 13:2141,447213,213,331201,962,0001,131,0002,113,536
4Aug 1, 2026 13:2141,553213,711,852202,504,0001,109,0002,113,536
5Aug 1, 2026 13:2141,691214,395,553203,156,0001,133,0002,113,536
6Aug 1, 2026 13:2141,822215,129,778203,809,0001,122,0002,113,536
7Aug 1, 2026 13:2141,829215,769,726203,857,0001,109,0002,113,536
8Aug 1, 2026 13:2141,983215,914,097204,625,0001,096,0002,113,536
9Aug 1, 2026 13:2141,991216,667,102204,638,0001,118,0002,113,536