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: 59,389Success
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:3459,100299,482,940279,205,00010,385,00020,480
2Jul 27, 2026 13:3459,104299,523,682279,074,00010,540,00020,480
3Jul 27, 2026 13:3459,152299,805,535279,458,00010,389,00024,576
4Jul 27, 2026 13:3459,376300,909,938279,279,00011,665,00020,480
5Jul 27, 2026 13:3459,389300,924,559278,821,00012,189,00020,480
6Jul 27, 2026 13:3459,431301,090,458279,292,00011,920,00020,480
7Jul 27, 2026 13:3459,605301,918,112279,503,00012,566,0002,113,536
8Jul 27, 2026 13:3459,627302,080,735279,653,00012,523,0002,113,536
9Jul 27, 2026 13:3459,683302,394,716280,144,00012,307,00020,480