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 listOct 13, 2026 18:43Karthik ReddyKarthik ReddyScore: 23,302Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 18:4923,2093,122,814,973112,644,0001,084,00020,480
2Oct 13, 2026 18:4923,2623,123,099,551112,886,0001,098,00020,480
3Oct 13, 2026 18:4923,2643,123,214,550112,915,0001,080,00020,480
4Oct 13, 2026 18:4923,2823,123,724,386112,975,0001,107,00020,480
5Oct 13, 2026 18:4923,3023,123,428,861113,179,0001,005,00020,480
6Oct 13, 2026 18:4923,3063,123,310,896113,101,0001,103,00020,480
7Oct 13, 2026 18:4923,3113,123,480,811113,126,0001,102,00020,480
8Oct 13, 2026 18:4923,3353,123,481,437113,265,0001,080,00020,480
9Oct 13, 2026 18:4923,4583,124,112,449113,847,0001,101,00020,480