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 listJul 28, 2025 13:23zielajzielajScore: 25,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2025 13:2324,980143,506,896122,403,00002,338,816
2Jul 28, 2025 13:2324,990144,171,426120,444,0002,007,0002,326,528
3Jul 28, 2025 13:2324,990151,638,295122,452,00002,297,856
4Jul 28, 2025 13:2325,007143,926,333122,535,00002,310,144
5Jul 28, 2025 13:2325,018145,278,411120,596,0001,993,0002,478,080
6Jul 28, 2025 13:2325,046143,006,551119,732,0002,993,0002,478,080
7Jul 28, 2025 13:2325,049143,081,111121,742,000997,0002,301,952
8Jul 28, 2025 13:2325,056153,545,306121,775,000998,0002,318,336
9Jul 28, 2025 13:2326,035158,334,922126,574,000996,0002,322,432