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 listDec 31, 2025 14:59Aniruddha DebAniruddha DebScore: 139,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 14:59136,872691,954,063669,673,000999,0002,531,328
2Dec 31, 2025 14:59137,269699,418,120671,621,000999,0002,416,640
3Dec 31, 2025 14:59139,381703,868,207681,968,000999,0002,420,736
4Dec 31, 2025 14:59139,678709,464,617683,422,000999,0002,273,280
5Dec 31, 2025 14:59139,745707,720,895682,752,0001,999,0002,428,928
6Dec 31, 2025 14:59139,896713,328,929683,492,0001,998,0002,424,832
7Dec 31, 2025 14:59140,559708,787,960687,742,000999,0002,273,280
8Dec 31, 2025 14:59143,688729,643,398704,069,00002,273,280
9Dec 31, 2025 14:59145,332734,152,698711,126,0001,000,0002,531,328