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:08anboto1anboto1Score: 57,874Success
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:0957,551291,129,190280,836,0001,164,0002,113,536
2Aug 3, 2026 21:0957,683291,741,393281,531,0001,117,0002,113,536
3Aug 3, 2026 21:0957,694291,176,517281,547,0001,157,0002,113,536
4Aug 3, 2026 21:0957,701291,753,422281,522,0001,213,0002,113,536
5Aug 3, 2026 21:0957,874292,284,492282,421,0001,162,0002,113,536
6Aug 3, 2026 21:0957,912292,202,847282,689,0001,084,0002,113,536
7Aug 3, 2026 21:0957,985292,597,494283,005,0001,122,0002,113,536
8Aug 3, 2026 21:0958,704296,214,736286,530,0001,122,0002,113,536
9Aug 3, 2026 21:0959,023297,713,782288,128,0001,088,0002,113,536