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:36Andrew EpsteinAndrew EpsteinScore: 239,765Success
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:37239,5061,184,045,7921,172,475,0001,109,0002,117,632stderr
2Sep 25, 2026 00:37239,6771,184,799,8091,173,304,0001,115,0002,117,632stderr
3Sep 25, 2026 00:37239,6891,185,145,6481,172,366,0002,112,0002,117,632stderr
4Sep 25, 2026 00:37239,6911,185,069,1831,173,383,0001,103,0002,117,632stderr
5Sep 25, 2026 00:37239,7651,186,206,7301,172,681,0002,169,0002,117,632stderr
6Sep 25, 2026 00:37239,7881,185,457,6641,173,867,0001,098,0002,117,632stderr
7Sep 25, 2026 00:37239,7901,185,422,0181,173,847,0001,124,0002,117,632stderr
8Sep 25, 2026 00:37239,8041,186,312,7871,173,935,0001,105,0002,117,632stderr
9Sep 25, 2026 00:37240,9351,191,863,9841,179,465,0001,118,0002,117,632stderr