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:20Andrew EpsteinAndrew EpsteinScore: 342,743Success
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:21341,9151,686,629,2221,674,270,0001,118,0002,117,632stderr
2Sep 24, 2026 14:21342,0051,686,414,2931,674,723,0001,105,0002,117,632stderr
3Sep 24, 2026 14:21342,0111,686,452,7541,674,739,0001,117,0002,117,632stderr
4Sep 24, 2026 14:21342,1311,687,293,4441,675,326,0001,118,0002,117,632stderr
5Sep 24, 2026 14:21342,7431,690,247,4631,677,308,0002,136,0002,117,632stderr
6Sep 24, 2026 14:21342,8191,690,414,0661,678,701,0001,115,0002,117,632stderr
7Sep 24, 2026 14:21342,8961,691,367,9731,679,078,0001,117,0002,117,632stderr
8Sep 24, 2026 14:21342,9531,691,130,3421,678,319,0002,155,0002,117,632stderr
9Sep 24, 2026 14:21344,0041,696,229,5581,684,500,0001,122,0002,117,632stderr