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 04:35Karthik ReddyKarthik ReddyScore: 23,285Success
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 04:3523,188122,465,029112,540,0001,085,00020,480
2Oct 13, 2026 04:3523,247122,885,397112,847,0001,066,00020,480
3Oct 13, 2026 04:3523,273123,034,902112,974,0001,067,00020,480
4Oct 13, 2026 04:3523,283123,042,159113,022,0001,066,00020,480
5Oct 13, 2026 04:3523,285125,397,203113,047,0001,050,00020,480
6Oct 13, 2026 04:3523,407123,763,040113,550,0001,149,00020,480
7Oct 13, 2026 04:3523,531135,379,626114,150,0001,155,00020,480
8Oct 13, 2026 04:3523,665135,273,051114,816,0001,146,00020,480
9Oct 13, 2026 04:3523,814133,892,148115,562,0001,130,00020,480