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:51Kevin HeaveyKevin HeaveyScore: 53,620Success
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:0753,355271,574,345249,797,00011,646,00020,480
2Jul 27, 2026 13:0753,370271,563,691250,160,00011,355,00020,480
3Jul 27, 2026 13:0753,483272,754,568250,238,00011,829,0002,113,536
4Jul 27, 2026 13:0753,579272,546,361249,724,00012,815,00020,480
5Jul 27, 2026 13:0753,620272,718,174250,135,00012,603,00020,480
6Jul 27, 2026 13:0753,699273,857,550249,706,00013,423,00020,480
7Jul 27, 2026 13:0753,700273,227,155249,827,00013,305,00020,480
8Jul 27, 2026 13:0753,707273,208,280249,633,00013,533,00020,480
9Jul 27, 2026 13:0753,817273,790,967249,741,00013,964,00020,480