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 listMar 20, 2026 02:40Dominique GarmierDominique GarmierScore: 228,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 02:40227,5811,145,816,8821,113,148,0001,998,0002,273,280
2Mar 20, 2026 02:40228,0711,147,536,4131,115,550,0001,999,0002,465,792
3Mar 20, 2026 02:40230,2241,157,841,6111,125,100,0002,997,0002,273,280