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 22:18anboto1anboto1Score: 57,462Success
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 22:1857,199289,761,079279,135,0001,141,0002,113,536
2Aug 3, 2026 22:1857,203288,747,350279,144,0001,152,0002,113,536
3Aug 3, 2026 22:1857,212288,758,051279,214,0001,129,0002,113,536
4Aug 3, 2026 22:1857,386289,702,136280,012,0001,182,0002,113,536
5Aug 3, 2026 22:1857,462290,583,032280,463,0001,102,0002,113,536
6Aug 3, 2026 22:1857,537291,041,501280,817,0001,115,0002,113,536
7Aug 3, 2026 22:1858,668296,008,624286,378,0001,097,0002,113,536
8Aug 3, 2026 22:1858,810297,300,412287,086,0001,084,0002,113,536
9Aug 3, 2026 22:1858,825297,385,588287,136,0001,111,0002,113,536