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 16:54Andrew EpsteinAndrew EpsteinScore: 210,793Success
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 16:55210,5421,042,227,4051,030,553,0001,106,0002,117,632stderr
2Sep 25, 2026 16:55210,6231,043,331,2321,030,930,0001,125,0002,117,632stderr
3Sep 25, 2026 16:55210,7501,043,385,0351,031,563,0001,113,0002,117,632stderr
4Sep 25, 2026 16:55210,7791,043,391,8431,031,694,0001,126,0002,117,632stderr
5Sep 25, 2026 16:55210,7931,044,128,9611,031,764,0001,126,0002,117,632stderr
6Sep 25, 2026 16:55210,9681,045,000,4531,032,636,0001,109,0002,117,632stderr
7Sep 25, 2026 16:55212,0221,049,513,3131,036,554,0002,355,0002,117,632stderr
8Sep 25, 2026 16:55212,6441,052,525,6041,040,853,0001,103,0002,117,632stderr
9Sep 25, 2026 16:55213,5171,057,630,9841,043,946,0002,290,0002,117,632stderr