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 26, 2025 01:17zielajzielajScore: 25,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2025 01:2425,609153,523,946125,483,00002,465,792
2Jul 26, 2025 01:2425,639155,052,454121,644,0003,988,0002,334,720
3Jul 26, 2025 01:2425,644154,385,214125,654,00002,322,432
4Jul 26, 2025 01:2425,644148,637,535124,657,000997,0002,338,816
5Jul 26, 2025 01:2425,645151,915,731124,665,000997,0002,306,048
6Jul 26, 2025 01:2425,648152,639,352124,678,000997,0002,322,432
7Jul 26, 2025 01:1725,653153,016,931123,707,0001,995,0002,469,888
8Jul 26, 2025 01:1725,659154,450,546124,730,000997,0002,281,472
9Jul 26, 2025 01:2427,743161,056,372133,941,0001,999,0002,351,104
10Jul 26, 2025 01:2427,850161,384,443135,463,0001,003,0002,314,240
11Jul 26, 2025 01:1727,990154,059,666136,149,0001,001,0002,297,856
12Jul 26, 2025 01:2428,034164,816,917135,362,0002,005,0002,461,696