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:37anboto1anboto1Score: 57,696Success
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:3957,505290,208,324280,767,0001,012,0002,113,536
2Aug 3, 2026 21:3957,582291,207,323280,954,0001,202,0002,113,536
3Aug 3, 2026 21:3957,585292,006,920281,010,0001,161,0002,113,536
4Aug 3, 2026 21:3957,614291,397,184281,219,0001,093,0002,113,536
5Aug 3, 2026 21:3957,696291,185,456281,603,0001,108,0002,113,536
6Aug 3, 2026 21:3957,726291,316,056281,769,0001,092,0002,113,536
7Aug 3, 2026 21:3957,729291,069,377281,683,0001,191,0002,113,536
8Aug 3, 2026 21:3957,791292,333,748282,079,0001,097,0002,113,536
9Aug 3, 2026 21:3957,802292,362,272282,069,0001,161,0002,113,536