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 16:23Andrew EpsteinAndrew EpsteinScore: 190,865Success
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 16:24190,734945,066,260933,478,0001,119,0002,117,632stderr
2Sep 24, 2026 16:24190,738945,113,863933,501,0001,119,0002,117,632stderr
3Sep 24, 2026 16:24190,788945,342,263933,758,0001,108,0002,117,632stderr
4Sep 24, 2026 16:24190,803945,507,527933,826,0001,109,0002,117,632stderr
5Sep 24, 2026 16:24190,865945,741,080934,114,0001,128,0002,117,632stderr
6Sep 24, 2026 16:24190,924946,263,089933,384,0002,146,0002,117,632stderr
7Sep 24, 2026 16:24191,337948,766,933936,426,0001,127,0002,117,632stderr
8Sep 24, 2026 16:24192,321952,879,010941,264,0001,113,0002,117,632stderr
9Sep 24, 2026 16:24192,389953,119,878941,597,0001,111,0002,117,632stderr