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, 2026 00:15Kevin HeaveyKevin HeaveyScore: 56,811Success
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, 2026 07:5856,177286,107,273234,539,00040,732,00020,480
2Jul 28, 2026 07:5856,318286,082,224234,314,00041,647,00020,480
3Jul 28, 2026 07:5856,326286,960,070234,384,00041,615,0002,113,536
4Jul 28, 2026 07:5856,516287,055,084234,299,00042,632,00020,480
5Jul 28, 2026 07:5856,811288,543,864235,108,00043,266,00020,480
6Jul 28, 2026 07:5856,828288,621,366234,211,00044,248,0002,113,536
7Jul 28, 2026 07:5858,615297,976,092234,637,00052,578,00020,480
8Jul 28, 2026 07:5858,741298,029,959234,472,00053,361,00020,480
9Jul 28, 2026 07:5858,958299,855,611234,506,00054,391,00020,480