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:32Karthik ReddyKarthik ReddyScore: 25,918Success
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:3225,844135,510,743125,527,0001,113,00020,480
2Oct 12, 2026 20:3225,866135,625,113125,673,0001,075,00020,480
3Oct 12, 2026 20:3225,871135,681,472125,659,0001,112,00020,480
4Oct 12, 2026 20:3225,908135,897,848125,881,0001,069,00020,480
5Oct 12, 2026 20:3225,918135,957,507125,945,0001,058,00020,480
6Oct 12, 2026 20:3225,966136,273,542126,147,0001,089,00020,480
7Oct 12, 2026 20:3226,013136,431,782126,380,0001,087,00020,480
8Oct 12, 2026 20:3226,014141,282,369126,324,0001,145,00020,480
9Oct 12, 2026 20:3226,028138,503,541126,526,0001,014,00020,480