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 27, 2026 12:47Kevin HeaveyKevin HeaveyScore: 54,295Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 13:0353,728273,067,487252,489,00010,779,00020,480
2Jul 27, 2026 13:0353,831273,656,866252,954,00010,822,00020,480
3Jul 27, 2026 13:0353,843273,696,137253,587,00010,248,00020,480
4Jul 27, 2026 13:0354,097274,914,645252,436,00012,644,00020,480
5Jul 27, 2026 13:0354,295275,868,720253,358,00012,692,00020,480
6Jul 27, 2026 13:0354,360276,252,008253,511,00012,853,00020,480
7Jul 27, 2026 13:0354,422276,458,971253,432,00013,237,00020,480
8Jul 27, 2026 13:0354,485276,935,107253,336,00013,643,00020,480
9Jul 27, 2026 13:0354,551277,192,729253,725,00013,578,00020,480