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 15:03Andrew EpsteinAndrew EpsteinScore: 251,599Success
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 15:05251,4101,242,318,4751,230,905,0001,005,0002,117,632stderr
2Sep 24, 2026 15:05251,5421,244,091,2881,231,558,0001,001,0002,117,632stderr
3Sep 24, 2026 15:05251,5651,243,114,0091,231,670,0001,000,0002,117,632stderr
4Sep 24, 2026 15:05251,5711,243,682,9901,231,691,0001,007,0002,117,632stderr
5Sep 24, 2026 15:05251,5991,243,252,1481,231,837,0001,001,0002,117,632stderr
6Sep 24, 2026 15:05251,6161,243,470,5421,231,920,0001,000,0002,117,632stderr
7Sep 24, 2026 15:05251,6441,243,766,7681,232,056,0001,003,0002,117,632stderr
8Sep 24, 2026 15:05251,6521,243,498,6451,232,095,0001,001,0002,117,632stderr
9Sep 24, 2026 15:05251,6721,243,598,6641,232,177,0001,016,0002,117,632stderr