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 14:01Andrew EpsteinAndrew EpsteinScore: 331,635Success
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 14:02331,2341,633,607,8701,621,952,0001,098,0002,117,632stderr
2Sep 24, 2026 14:02331,2411,633,563,4051,621,979,0001,104,0002,117,632stderr
3Sep 24, 2026 14:02331,2641,633,752,4001,622,091,0001,105,0002,117,632stderr
4Sep 24, 2026 14:02331,3401,634,001,4971,622,449,0001,119,0002,117,632stderr
5Sep 24, 2026 14:02331,6351,637,694,4811,622,815,0002,201,0002,117,632stderr
6Sep 24, 2026 14:02331,8931,637,554,0831,625,165,0001,115,0002,117,632stderr
7Sep 24, 2026 14:02332,9111,641,967,3891,630,150,0001,117,0002,117,632stderr
8Sep 24, 2026 14:02336,6841,660,356,7291,648,634,0001,118,0002,117,632stderr
9Sep 24, 2026 14:02340,8981,680,972,8831,669,282,0001,120,0002,117,632stderr