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 23:47anboto1anboto1Score: 186,694Success
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 23:48186,605924,428,606913,229,0001,139,0002,113,536
2Aug 2, 2026 23:48186,617924,581,951913,283,0001,141,0002,113,536
3Aug 2, 2026 23:48186,630925,399,516913,347,0001,144,0002,113,536
4Aug 2, 2026 23:48186,678927,122,136912,555,0002,171,0002,113,536
5Aug 2, 2026 23:48186,694925,579,349913,665,0001,137,0002,113,536
6Aug 2, 2026 23:48186,824934,174,161914,082,0001,359,0002,113,536
7Aug 2, 2026 23:48186,835926,465,876913,311,0002,181,0002,113,536
8Aug 2, 2026 23:48186,905926,679,043914,685,0001,154,0002,113,536
9Aug 2, 2026 23:48187,729930,026,737918,738,0001,135,0002,113,536