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 listSep 23, 2026 13:19Kevin HeaveyKevin HeaveyScore: 36,899Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 13:2036,654190,012,448178,480,0001,127,00020,480
2Sep 23, 2026 13:2036,675190,123,189178,592,0001,117,00020,480
3Sep 23, 2026 13:2036,689191,034,575178,661,0001,118,00020,480
4Sep 23, 2026 13:2036,738191,181,783178,895,0001,124,00020,480
5Sep 23, 2026 13:2036,899191,381,152179,681,0001,126,00020,480
6Sep 23, 2026 13:2037,901196,575,570184,517,0001,201,00020,480
7Sep 23, 2026 13:2039,163203,012,914190,766,0001,134,00020,480
8Sep 23, 2026 13:2042,258217,545,348205,933,0001,135,00020,480
9Sep 23, 2026 13:2084,534424,762,950412,924,0001,294,00020,480