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 listAug 13, 2026 15:05Tomislav TunkovicTomislav TunkovicError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 15:050318,666,364309,082,0001,176,0002,117,632expected "560381949337 ", got "49280841113 "
2Aug 13, 2026 15:050318,627,352309,065,0001,241,0002,117,632expected "560378467000 ", got "49277358776 "
3Aug 13, 2026 15:050318,650,353309,162,0001,173,0002,117,632expected "560380414082 ", got "49279305858 "