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:55Karthik ReddyKarthik ReddyScore: 23,978Success
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:5623,952126,329,114116,241,0001,128,00020,480
2Oct 12, 2026 20:5623,957126,329,062116,327,0001,067,00020,480
3Oct 12, 2026 20:5623,961126,403,990116,320,0001,093,00020,480
4Oct 12, 2026 20:5623,968126,376,740116,360,0001,085,00020,480
5Oct 12, 2026 20:5623,978126,517,789116,415,0001,078,00020,480
6Oct 12, 2026 20:5623,986126,397,947116,396,0001,138,00020,480
7Oct 12, 2026 20:5623,993126,566,319116,461,0001,108,00020,480
8Oct 12, 2026 20:5624,006126,616,097116,533,0001,097,00020,480
9Oct 12, 2026 20:5624,016126,544,083116,676,0001,004,00020,480