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 listMay 11, 2026 13:23wnwnScore: 98,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 13:2798,229490,946,422479,310,0002,013,0002,113,536
2May 11, 2026 13:2798,238490,628,563479,327,0002,043,0002,113,536
3May 11, 2026 13:2798,261491,285,608479,462,0002,017,0002,113,536
4May 11, 2026 13:2798,261491,512,869479,422,0002,057,0002,113,536
5May 11, 2026 13:2798,764492,829,821481,904,0002,040,0002,113,536
6May 11, 2026 13:2798,772494,229,745481,913,0002,070,0002,113,536
7May 11, 2026 13:2798,788494,537,268482,056,0002,008,0002,113,536
8May 11, 2026 13:2798,792493,786,984482,064,0002,017,0002,113,536
9May 11, 2026 13:2798,843493,046,156482,250,0002,085,0002,113,536