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:35Kevin HeaveyKevin HeaveyScore: 83,483Success
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 11:3880,396404,273,242378,226,00015,718,00020,480
2Jul 27, 2026 11:3880,482404,165,494378,506,00015,860,0002,113,536
3Jul 27, 2026 11:3880,713405,346,285379,273,00016,223,0002,113,536
4Jul 27, 2026 11:3883,229417,714,678381,342,00026,481,00020,480
5Jul 27, 2026 11:3883,483418,933,047381,359,00027,711,00020,480
6Jul 27, 2026 11:3883,663419,968,456381,222,00028,728,00020,480
7Jul 27, 2026 11:3884,975426,279,829382,807,00033,571,00020,480
8Jul 27, 2026 11:3885,786430,223,714386,891,00033,463,00020,480
9Jul 27, 2026 11:3885,795430,389,328382,656,00037,740,00020,480