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 listApr 3, 2026 15:00limanjun99limanjun99Score: 121,953Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2026 15:00121,837619,742,414595,002,0002,000,0002,293,760
2Apr 4, 2026 03:13121,919623,463,465594,406,0002,997,0002,293,760
3Apr 4, 2026 03:13121,924620,391,546594,433,0002,997,0002,293,760
4Apr 3, 2026 15:00121,937619,284,614594,495,0002,997,0002,293,760
5Apr 3, 2026 15:00121,949620,871,950595,550,0001,998,0002,273,280
6Apr 4, 2026 03:13121,950620,870,859595,555,0001,998,0002,293,760
7Apr 3, 2026 15:00121,953622,110,779594,574,0002,997,0002,293,760
8Apr 3, 2026 15:00122,003621,165,555595,815,0001,999,0002,293,760
9Apr 3, 2026 15:00122,006619,760,817594,830,0002,999,0002,293,760
10Apr 3, 2026 15:00122,062623,941,171596,103,0002,000,0002,293,760
11Apr 3, 2026 15:00122,775625,604,916598,599,0002,997,0002,293,760
12Apr 3, 2026 15:00122,924631,092,216600,328,0002,001,0002,273,280