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 listNov 12, 2025 09:45izotoffizotoffScore: 253,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 09:45253,5831,274,100,2081,238,557,0003,998,0002,514,944
2Nov 12, 2025 09:45253,5911,266,432,0191,239,597,0002,999,0002,510,848
3Nov 12, 2025 09:45253,6571,270,774,0321,238,924,0003,996,0002,318,336