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 15:05Kevin HeaveyKevin HeaveyScore: 63,388Success
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 15:3463,036318,910,834305,387,0003,494,0002,113,536
2Jul 27, 2026 15:3463,060319,016,497305,063,0003,935,00020,480
3Jul 27, 2026 15:3463,191319,652,392306,530,0003,106,0002,113,536
4Jul 27, 2026 15:3463,320320,336,595306,044,0004,226,0002,113,536
5Jul 27, 2026 15:3463,388320,642,299306,552,0004,050,00020,480
6Jul 27, 2026 15:3463,415320,763,876307,270,0003,465,0002,113,536
7Jul 27, 2026 15:3463,476321,067,458305,928,0005,109,0002,113,536
8Jul 27, 2026 15:3463,495321,172,717306,273,0004,854,00020,480
9Jul 27, 2026 15:3463,540321,344,394306,771,0004,575,0002,113,536