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 24, 2026 15:28Andrew EpsteinAndrew EpsteinScore: 239,125Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 15:29238,4491,178,968,9651,167,287,0001,116,0002,117,632stderr
2Sep 24, 2026 15:29238,4681,179,244,0731,166,187,0002,309,0002,117,632stderr
3Sep 24, 2026 15:29238,9901,181,472,6161,169,946,0001,109,0002,117,632stderr
4Sep 24, 2026 15:29239,0771,181,964,2721,170,364,0001,114,0002,117,632stderr
5Sep 24, 2026 15:29239,1251,182,356,5401,169,582,0002,131,0002,117,632stderr
6Sep 24, 2026 15:29239,1601,182,405,1711,169,719,0002,169,0002,117,632stderr
7Sep 24, 2026 15:29239,1831,182,632,9931,170,879,0001,118,0002,117,632stderr
8Sep 24, 2026 15:29239,2111,183,388,2731,171,021,0001,117,0002,117,632stderr
9Sep 24, 2026 15:29240,3291,188,089,1681,176,513,0001,100,0002,117,632stderr