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 02:12Karthik ReddyKarthik ReddyScore: 23,359Success
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 02:1223,314123,103,178113,180,0001,061,00020,480
2Oct 13, 2026 02:1223,321123,394,247113,221,0001,054,00020,480
3Oct 13, 2026 02:1223,355124,083,736113,366,0001,077,00020,480
4Oct 13, 2026 02:1223,356123,338,536113,358,0001,090,00020,480
5Oct 13, 2026 02:1223,359123,472,575113,366,0001,096,00020,480
6Oct 13, 2026 02:1223,361123,464,203113,413,0001,058,00020,480
7Oct 13, 2026 02:1223,381123,493,355113,507,0001,061,00020,480
8Oct 13, 2026 02:1223,407123,621,635113,531,0001,167,00020,480
9Oct 13, 2026 02:1223,421123,624,446113,660,0001,105,00020,480