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 12, 2026 20:23Karthik ReddyKarthik ReddyScore: 26,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 20:2426,546139,058,934129,012,0001,065,00020,480
2Oct 12, 2026 20:2426,565139,107,264129,083,0001,086,00020,480
3Oct 12, 2026 20:2426,567139,169,358129,112,0001,070,00020,480
4Oct 12, 2026 20:2426,568139,195,173129,122,0001,062,00020,480
5Oct 12, 2026 20:2426,586139,290,927129,173,0001,103,00020,480
6Oct 12, 2026 20:2426,603139,308,592129,271,0001,088,00020,480
7Oct 12, 2026 20:2426,605139,260,147129,310,0001,055,00020,480
8Oct 12, 2026 20:2426,676139,707,200129,645,0001,069,00020,480
9Oct 12, 2026 20:2426,712139,818,991129,791,0001,102,00020,480