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 listSep 23, 2026 15:32Kevin HeaveyKevin HeaveyScore: 27,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 15:3327,556145,354,396133,919,0001,110,00020,480
2Sep 23, 2026 15:3327,580146,142,347134,039,0001,103,00020,480
3Sep 23, 2026 15:3327,592145,556,241134,087,0001,114,00020,480
4Sep 23, 2026 15:3327,600145,655,950134,121,0001,119,00020,480
5Sep 23, 2026 15:3327,601146,388,426134,138,0001,108,00020,480
6Sep 23, 2026 15:3327,610146,454,351134,172,0001,120,00020,480
7Sep 23, 2026 15:3327,611145,987,048134,158,0001,140,00020,480
8Sep 23, 2026 15:3327,615146,492,878134,194,0001,124,00020,480
9Sep 23, 2026 15:3327,647146,627,932134,355,0001,120,00020,480