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:51anboto1anboto1Score: 75,705Success
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:5475,619379,665,104369,286,0001,251,0002,113,536
2Aug 3, 2026 20:5475,625379,735,117369,407,0001,157,0002,113,536
3Aug 3, 2026 20:5475,639379,731,244369,631,0001,001,0002,113,536
4Aug 3, 2026 20:5475,643379,724,960369,554,0001,097,0002,113,536
5Aug 3, 2026 20:5475,705380,011,234369,870,0001,088,0002,113,536
6Aug 3, 2026 20:5475,726380,134,850369,897,0001,163,0002,113,536
7Aug 3, 2026 20:5475,742380,201,809370,045,0001,093,0002,113,536
8Aug 3, 2026 20:5475,828380,627,580370,369,0001,192,0002,113,536
9Aug 3, 2026 20:5477,253387,844,713377,427,0001,115,0002,113,536