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:18A_ShamanA_ShamanScore: 345,308Success
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:19345,1461,700,594,0691,689,151,0002,065,0002,113,536
2Jun 28, 2026 09:19345,1911,701,308,9991,689,353,0002,086,0002,113,536
3Jun 28, 2026 09:19345,2191,700,973,7081,689,478,0002,096,0002,113,536
4Jun 28, 2026 09:19345,2911,701,297,3261,689,913,0002,017,0002,113,536
5Jun 28, 2026 09:19345,3081,701,433,8281,689,974,0002,039,0002,113,536
6Jun 28, 2026 09:19345,3331,701,517,2801,690,067,0002,067,0002,113,536
7Jun 28, 2026 09:19345,3711,701,745,1591,690,318,0002,004,0002,113,536
8Jun 28, 2026 09:19346,1081,706,388,9091,693,737,0002,197,0002,113,536
9Jun 28, 2026 09:19346,1901,705,708,1721,694,295,0002,040,0002,113,536