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 listFeb 14, 2026 02:26olliecrowolliecrowScore: 102,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 02:26102,391532,360,880500,715,000999,0002,281,472
2Feb 14, 2026 02:26102,502529,346,082502,261,00002,281,472
3Feb 14, 2026 02:26102,508526,221,185501,290,0001,000,0002,281,472
4Feb 14, 2026 02:26102,523531,168,416502,361,00002,281,472
5Feb 14, 2026 02:26102,531531,406,683501,404,000998,0002,334,720
6Feb 14, 2026 02:26102,531534,567,011501,403,0001,000,0002,326,528
7Feb 14, 2026 02:26102,539535,271,637502,441,00002,281,472
8Feb 14, 2026 02:26102,541529,684,069501,454,000998,0002,330,624
9Feb 14, 2026 02:26102,542529,828,762501,458,000998,0002,334,720