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 3, 2026 20:53anboto1anboto1Score: 57,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:5657,566290,469,825280,973,0001,104,0002,113,536
2Aug 3, 2026 20:5657,592291,297,921281,042,0001,163,0002,113,536
3Aug 3, 2026 20:5657,616290,810,067281,151,0001,170,0002,113,536
4Aug 3, 2026 20:5657,659290,974,242281,420,0001,112,0002,113,536
5Aug 3, 2026 20:5657,660291,271,697281,411,0001,127,0002,113,536
6Aug 3, 2026 20:5657,750291,993,279281,870,0001,107,0002,113,536
7Aug 3, 2026 20:5657,755291,439,269281,901,0001,100,0002,113,536
8Aug 3, 2026 20:5657,848292,514,315282,357,0001,103,0002,113,536
9Aug 3, 2026 20:5658,247293,962,210284,223,0001,192,0002,113,536