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 listJul 14, 2025 21:05Valentin KofmanValentin KofmanScore: 145,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2025 21:05145,190735,073,326708,434,0002,997,0002,265,088
2Jul 14, 2025 21:05145,216734,745,266708,559,0002,998,0002,289,664
3Jul 14, 2025 21:05145,218736,935,205708,572,0002,998,0002,289,664
4Jul 14, 2025 21:05145,230735,116,305708,627,0002,998,0002,265,088
5Jul 14, 2025 21:05145,433737,272,806709,622,0002,998,0002,281,472
6Jul 14, 2025 21:05145,531739,401,784711,104,0002,000,0002,281,472
7Jul 14, 2025 21:05145,707742,283,091710,963,0002,999,0002,289,664
8Jul 14, 2025 21:05145,750742,349,688711,180,0002,996,0002,273,280
9Jul 14, 2025 21:05145,763752,324,297711,245,0002,996,0002,273,280