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 11:58Kevin HeaveyKevin HeaveyScore: 74,934Success
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 12:0474,534375,113,818355,025,00010,193,0002,113,536
2Jul 27, 2026 12:0474,560375,320,272355,171,00010,176,00020,480
3Jul 27, 2026 12:0474,872376,713,126355,124,00011,750,00020,480
4Jul 27, 2026 12:0474,891376,809,971355,050,00011,916,0002,113,536
5Jul 27, 2026 12:0474,934377,139,612355,262,00011,917,00020,480
6Jul 27, 2026 12:0475,014377,505,188355,215,00012,357,00020,480
7Jul 27, 2026 12:0475,055377,573,851355,156,00012,615,00020,480
8Jul 27, 2026 12:0475,163378,837,451355,784,00012,519,0002,113,536
9Jul 27, 2026 12:0475,763381,100,465355,964,00015,276,00020,480