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 13:22Kevin HeaveyKevin HeaveyScore: 58,203Success
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:3657,848293,381,731273,190,00010,269,00020,480
2Jul 27, 2026 13:3657,954293,857,913273,945,00010,032,00020,480
3Jul 27, 2026 13:3657,998294,036,547274,042,00010,151,0002,113,536
4Jul 27, 2026 13:3658,168294,897,280272,934,00012,092,00020,480
5Jul 27, 2026 13:3658,203297,059,026272,842,00012,356,00020,480
6Jul 27, 2026 13:3658,352295,794,581272,941,00012,988,00020,480
7Jul 27, 2026 13:3658,405295,969,614273,659,00012,527,00020,480
8Jul 27, 2026 13:3658,502296,505,484273,887,00012,773,0002,113,536
9Jul 27, 2026 13:3658,677297,458,488274,948,00012,573,0002,113,536