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:47Kevin HeaveyKevin HeaveyScore: 61,665Success
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:5061,288310,406,309296,408,0003,906,0002,113,536
2Jul 27, 2026 15:5061,399310,829,722296,282,0004,577,0002,113,536
3Jul 27, 2026 15:5061,421311,027,945296,363,0004,602,0002,113,536
4Jul 27, 2026 15:5061,657313,898,635296,963,0005,157,00020,480
5Jul 27, 2026 15:5061,665312,249,681296,384,0005,777,00020,480
6Jul 27, 2026 15:5061,715312,468,882296,318,0006,089,00020,480
7Jul 27, 2026 15:5061,933313,483,107298,585,0004,889,00020,480
8Jul 27, 2026 15:5062,088314,371,361299,265,0004,969,00020,480
9Jul 27, 2026 15:5062,120314,415,572298,696,0005,695,00020,480