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 18:44Andrew EpsteinAndrew EpsteinScore: 201,484Success
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 18:46200,684993,836,608982,242,0001,113,0002,117,632stderr
2Sep 24, 2026 18:46200,744994,278,713982,550,0001,098,0002,117,632stderr
3Sep 24, 2026 18:46200,827994,776,919981,883,0002,173,0002,117,632stderr
4Sep 24, 2026 18:46200,847995,375,475983,032,0001,120,0002,117,632stderr
5Sep 24, 2026 18:46201,484997,810,759986,165,0001,107,0002,117,632stderr
6Sep 24, 2026 18:46201,558998,229,641986,514,0001,122,0002,117,632stderr
7Sep 24, 2026 18:46202,0851,002,083,058989,099,0001,120,0002,117,632stderr
8Sep 24, 2026 18:46202,1211,000,986,020988,282,0002,113,0002,117,632stderr
9Sep 24, 2026 18:46202,6701,004,304,540991,969,0001,116,0002,117,632stderr