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:42Karthik ReddyKarthik ReddyScore: 23,719Success
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:4223,664124,933,187114,883,0001,073,00020,480
2Oct 12, 2026 20:4223,684124,967,979114,987,0001,068,00020,480
3Oct 12, 2026 20:4223,698125,099,421115,045,0001,076,00020,480
4Oct 12, 2026 20:4223,717125,233,395115,151,0001,064,00020,480
5Oct 12, 2026 20:4223,719125,458,135115,166,0001,058,00020,480
6Oct 12, 2026 20:4223,733125,277,765115,197,0001,095,00020,480
7Oct 12, 2026 20:4223,757128,100,781115,343,0001,071,00020,480
8Oct 12, 2026 20:4223,766125,355,984115,397,0001,061,00020,480
9Oct 12, 2026 20:4223,839125,716,094115,757,0001,056,00020,480