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:43Karthik ReddyKarthik ReddyScore: 25,248Success
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:4425,187132,315,645122,370,0001,051,00020,480
2Oct 12, 2026 20:4425,215132,471,889122,492,0001,063,00020,480
3Oct 12, 2026 20:4425,236134,014,874122,594,0001,064,00020,480
4Oct 12, 2026 20:4425,237132,537,316122,608,0001,057,00020,480
5Oct 12, 2026 20:4425,248132,669,753122,642,0001,076,00020,480
6Oct 12, 2026 20:4425,276132,844,871122,783,0001,070,00020,480
7Oct 12, 2026 20:4425,308132,930,489122,962,0001,048,00020,480
8Oct 12, 2026 20:4425,333133,061,398123,070,0001,063,00020,480
9Oct 12, 2026 20:4425,346133,077,000123,149,0001,050,00020,480