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:02Andrew EpsteinAndrew EpsteinScore: 216,721Success
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:02216,5371,071,634,0931,059,917,0001,117,0002,117,632stderr
2Sep 24, 2026 15:02216,5581,071,760,4771,060,031,0001,106,0002,117,632stderr
3Sep 24, 2026 15:02216,6351,073,536,0751,060,385,0001,129,0002,117,632stderr
4Sep 24, 2026 15:02216,7031,072,640,6171,060,730,0001,116,0002,117,632stderr
5Sep 24, 2026 15:02216,7211,072,357,6571,060,821,0001,116,0002,117,632stderr
6Sep 24, 2026 15:02216,7271,074,150,6381,059,841,0002,123,0002,117,632stderr
7Sep 24, 2026 15:02216,8801,073,302,1711,061,603,0001,109,0002,117,632stderr
8Sep 24, 2026 15:02216,9101,073,470,4251,061,747,0001,114,0002,117,632stderr
9Sep 24, 2026 15:02217,1571,074,652,0521,062,719,0001,352,0002,117,632stderr