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 21:02anboto1anboto1Score: 57,630Success
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 21:0457,605291,461,491281,137,0001,131,0002,113,536
2Aug 3, 2026 21:0457,607291,340,414281,176,0001,100,0002,113,536
3Aug 3, 2026 21:0457,611290,718,523281,202,0001,093,0002,113,536
4Aug 3, 2026 21:0457,624291,507,192281,214,0001,145,0002,113,536
5Aug 3, 2026 21:0457,630291,505,622281,231,0001,160,0002,113,536
6Aug 3, 2026 21:0457,676291,711,648281,525,0001,092,0002,113,536
7Aug 3, 2026 21:0457,690291,736,210281,681,0001,003,0002,113,536
8Aug 3, 2026 21:0457,840291,835,447282,244,0001,173,0002,113,536
9Aug 3, 2026 21:0457,912292,806,276282,613,0001,156,0002,113,536