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 27, 2026 09:50Dominique GarmierDominique GarmierScore: 318,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 09:50318,9141,591,533,3691,561,680,000999,0002,281,472
2Mar 28, 2026 00:42318,9551,588,142,6271,561,879,000999,0002,510,848
3Mar 28, 2026 00:42318,9831,587,968,4431,561,017,0001,998,0002,273,280
4Mar 28, 2026 00:42318,9891,597,639,1531,562,049,000999,0002,281,472
5Mar 27, 2026 09:50318,9991,586,721,5491,562,097,000999,0002,281,472
6Mar 27, 2026 09:50319,1271,593,359,1191,561,723,0001,998,0002,281,472