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 9, 2026 07:53Karthik ReddyKarthik ReddyScore: 23,815Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 07:5523,739126,595,008115,260,0001,063,00020,480
2Oct 9, 2026 07:5523,776125,383,490115,449,0001,056,00020,480
3Oct 9, 2026 07:5523,792125,271,790115,525,0001,056,00020,480
4Oct 9, 2026 07:5523,809125,476,277115,564,0001,102,00020,480
5Oct 9, 2026 07:5523,815125,227,052115,638,0001,058,00020,480
6Oct 9, 2026 07:5523,818125,430,615115,660,0001,053,00020,480
7Oct 9, 2026 07:5523,821125,417,116115,662,0001,064,00020,480
8Oct 9, 2026 07:5523,836125,525,359115,794,0001,004,00020,480
9Oct 9, 2026 07:5523,854125,677,325115,711,0001,178,00020,480