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 listJun 28, 2026 09:23A_ShamanA_ShamanScore: 151,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 09:24151,711753,951,490738,372,0005,015,0002,146,304
2Jun 28, 2026 09:24151,722753,453,617739,435,0004,004,0002,146,304
3Jun 28, 2026 09:24151,723753,473,227739,445,0004,000,0002,146,304
4Jun 28, 2026 09:24151,764753,705,545739,644,0004,001,0002,146,304
5Jun 28, 2026 09:24151,786754,262,912739,755,0004,001,0002,146,304
6Jun 28, 2026 09:24151,807754,235,538739,860,0003,996,0002,146,304
7Jun 28, 2026 09:24151,894754,821,413739,284,0004,999,0002,146,304
8Jun 28, 2026 09:24151,927755,005,931739,421,0005,023,0002,146,304
9Jun 28, 2026 09:24152,005754,915,416739,823,0005,006,0002,146,304