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 listMay 11, 2026 07:13wnwnScore: 107,663Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:15106,805533,060,358520,125,0003,224,0002,113,536
2May 11, 2026 07:15106,855537,852,855520,430,0003,161,0002,113,536
3May 11, 2026 07:15106,884533,164,394520,711,0003,022,0002,113,536
4May 11, 2026 07:15106,885534,676,730520,720,0003,021,0002,113,536
5May 11, 2026 07:15107,663536,452,482524,365,0003,185,0002,113,536
6May 11, 2026 07:15110,426550,105,843537,837,0003,254,0002,113,536
7May 11, 2026 07:15110,853553,730,939539,958,0003,225,0002,113,536
8May 11, 2026 07:15113,918569,014,155554,981,0003,222,0002,113,536
9May 11, 2026 07:15113,932567,294,701555,048,0003,221,0002,113,536