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 25, 2026 00:19Andrew EpsteinAndrew EpsteinScore: 180,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 00:19177,539881,224,990868,826,0001,119,0002,117,632stderr
2Sep 25, 2026 00:19180,264893,648,189882,175,0001,119,0002,117,632stderr
3Sep 25, 2026 00:19180,275893,892,276882,220,0001,129,0002,117,632stderr
4Sep 25, 2026 00:19180,282894,586,051882,271,0001,113,0002,117,632stderr
5Sep 25, 2026 00:19180,297894,116,104882,316,0001,141,0002,117,632stderr
6Sep 25, 2026 00:19180,300894,669,628882,345,0001,126,0002,117,632stderr
7Sep 25, 2026 00:19180,304894,062,272882,370,0001,123,0002,117,632stderr
8Sep 25, 2026 00:19180,397895,669,846881,593,0002,357,0002,117,632stderr
9Sep 25, 2026 00:19180,583895,484,684882,705,0002,153,0002,117,632stderr