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 00:22Andrew EpsteinAndrew EpsteinScore: 180,655Success
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 00:23180,595895,497,717883,799,0001,120,0002,117,632stderr
2Sep 25, 2026 00:23180,606895,455,807883,855,0001,116,0002,117,632stderr
3Sep 25, 2026 00:23180,607895,545,329883,857,0001,118,0002,117,632stderr
4Sep 25, 2026 00:23180,645896,351,639884,052,0001,113,0002,117,632stderr
5Sep 25, 2026 00:23180,655895,795,786883,087,0002,125,0002,117,632stderr
6Sep 25, 2026 00:23180,670895,914,514884,183,0001,103,0002,117,632stderr
7Sep 25, 2026 00:23180,675898,638,765883,179,0002,130,0002,117,632stderr
8Sep 25, 2026 00:23180,906899,742,389883,292,0003,152,0002,117,632stderr
9Sep 25, 2026 00:23181,126898,126,460886,384,0001,135,0002,117,632stderr