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:37anboto1anboto1Score: 57,709Success
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:3857,549290,501,907280,946,0001,046,0002,113,536
2Aug 3, 2026 20:3857,608290,731,939281,164,0001,116,0002,113,536
3Aug 3, 2026 20:3857,630290,893,068281,148,0001,242,0002,113,536
4Aug 3, 2026 20:3857,660291,816,114281,420,0001,116,0002,113,536
5Aug 3, 2026 20:3857,709291,307,985281,545,0001,233,0002,113,536
6Aug 3, 2026 20:3857,768291,489,764281,945,0001,122,0002,113,536
7Aug 3, 2026 20:3857,774291,655,433281,917,0001,176,0002,113,536
8Aug 3, 2026 20:3857,797291,626,000281,970,0001,238,0002,113,536
9Aug 3, 2026 20:3857,827291,818,796282,244,0001,111,0002,113,536