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 12:42Kevin HeaveyKevin HeaveyScore: 54,636Success
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 12:4554,122275,218,172253,347,00011,853,00020,480
2Jul 27, 2026 12:4554,170275,485,763253,510,00011,927,00020,480
3Jul 27, 2026 12:4554,259275,980,465253,010,00012,862,00020,480
4Jul 27, 2026 12:4554,474277,005,142254,125,00012,802,00020,480
5Jul 27, 2026 12:4554,636280,056,691253,455,00014,265,00020,480
6Jul 27, 2026 12:4554,650277,790,457253,085,00014,704,00020,480
7Jul 27, 2026 12:4554,692278,791,714253,437,00014,555,00020,480
8Jul 27, 2026 12:4554,728278,942,830253,306,00014,866,00020,480
9Jul 27, 2026 12:4554,885278,984,621253,509,00015,431,00020,480