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:04Dominique GarmierDominique GarmierScore: 2,095,550Success
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 08:392,077,86210,211,799,69210,179,527,0001,998,0002,285,568
2Mar 27, 2026 08:392,078,57510,219,723,56210,184,020,000999,0002,289,664
3Mar 27, 2026 09:042,092,04010,283,120,50310,247,999,0002,998,0002,285,568
4Mar 27, 2026 09:042,095,55010,298,130,73210,267,197,000999,0002,285,568
5Mar 27, 2026 09:042,095,90410,314,703,96910,268,929,000999,0002,289,664
6Mar 27, 2026 08:392,096,26110,307,425,02810,270,679,000999,0002,285,568