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 21, 2026 17:07A_ShamanA_ShamanScore: 149,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 17:08149,354741,038,132729,660,0002,178,0002,113,536
2Jun 21, 2026 17:08149,403741,243,140730,045,0002,030,0002,113,536
3Jun 21, 2026 17:08149,424741,439,909730,083,0002,098,0002,113,536
4Jun 21, 2026 17:08149,435741,613,964729,967,0002,267,0002,113,536
5Jun 21, 2026 17:08149,469749,574,788730,173,0002,229,0002,113,536
6Jun 21, 2026 17:08149,512741,776,054730,498,0002,113,0002,113,536
7Jun 21, 2026 17:08149,523741,948,805730,465,0002,199,0002,113,536
8Jun 21, 2026 17:08149,531741,863,496730,443,0002,261,0002,113,536
9Jun 21, 2026 17:08149,770744,200,776731,773,0002,102,0002,113,536