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 10, 2025 23:59izotoffizotoffScore: 1,070,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 23:591,069,9035,274,628,4205,241,526,000999,0002,342,912
2Nov 10, 2025 23:591,070,2965,278,141,6245,240,454,0003,997,0002,334,720
3Nov 10, 2025 23:591,070,3355,283,532,4125,242,643,0001,998,0002,326,528