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 listDec 31, 2025 13:46Aniruddha DebAniruddha DebScore: 185,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 13:46179,897904,609,192880,495,000999,0002,273,280
2Dec 31, 2025 13:46180,481910,751,987883,358,000999,0002,273,280
3Dec 31, 2025 13:46183,226920,747,908896,807,000999,0002,273,280
4Dec 31, 2025 13:46183,834928,258,783900,787,00002,428,928
5Dec 31, 2025 13:46185,772932,926,932909,285,000999,0002,273,280
6Dec 31, 2025 13:46186,645939,763,678914,560,00002,273,280
7Dec 31, 2025 13:46187,745939,811,888918,951,000999,0002,273,280
8Dec 31, 2025 13:46188,269945,097,517920,519,0001,998,0002,514,944
9Dec 31, 2025 13:46191,333959,182,339936,533,000999,0002,535,424