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 1, 2026 00:44anboto1anboto1Score: 191,381Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 00:45191,206947,259,373935,676,0001,236,0002,113,536
2Aug 1, 2026 00:45191,229947,295,667935,802,0001,223,0002,113,536
3Aug 1, 2026 00:45191,349947,742,173936,377,0001,236,0002,113,536
4Aug 1, 2026 00:45191,351947,892,804936,394,0001,227,0002,113,536
5Aug 1, 2026 00:45191,381947,991,675936,547,0001,222,0002,113,536
6Aug 1, 2026 00:45191,530948,601,822937,268,0001,231,0002,113,536
7Aug 1, 2026 00:45194,820964,763,151953,396,0001,223,0002,113,536
8Aug 1, 2026 00:45194,826964,809,159953,425,0001,223,0002,113,536
9Aug 1, 2026 00:45194,840964,889,599953,490,0001,227,0002,113,536