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 21, 2026 16:02Dominique GarmierDominique GarmierScore: 1,438,738Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 16:021,411,83013,783,703,8894,435,244,0002,482,723,000397,312
2Mar 21, 2026 16:021,438,73814,102,727,2464,611,245,0002,438,572,000393,216
3Mar 21, 2026 16:021,441,47015,037,012,0534,579,209,0002,483,995,000397,312