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 08:20Josu San MartinJosu San MartinScore: 37,064Success
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 08:2037,045192,400,448180,393,0001,129,0002,113,536
2Aug 1, 2026 08:2037,047191,650,379180,411,0001,121,0002,113,536
3Aug 1, 2026 08:2037,061192,518,400180,468,0001,132,0002,113,536
4Aug 1, 2026 08:2037,062191,709,685180,502,0001,102,0002,113,536
5Aug 1, 2026 08:2037,064192,476,230180,479,0001,139,0002,113,536
6Aug 1, 2026 08:2037,069191,866,583180,537,0001,104,0002,113,536
7Aug 1, 2026 08:2037,092192,669,834180,613,0001,139,0002,113,536
8Aug 1, 2026 08:2037,115192,001,556180,732,0001,133,0002,113,536
9Aug 1, 2026 08:2038,274197,624,246186,441,0001,104,0002,113,536