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:57Karthik ReddyKarthik ReddyScore: 23,811Success
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:5723,768125,461,447115,397,0001,068,00020,480
2Oct 12, 2026 20:5723,775125,522,798115,418,0001,080,00020,480
3Oct 12, 2026 20:5723,791125,517,164115,513,0001,066,00020,480
4Oct 12, 2026 20:5723,794125,718,919115,499,0001,092,00020,480
5Oct 12, 2026 20:5723,811125,680,678115,606,0001,071,00020,480
6Oct 12, 2026 20:5723,829125,720,328115,607,0001,158,00020,480
7Oct 12, 2026 20:5723,837125,785,359115,724,0001,082,00020,480
8Oct 12, 2026 20:5723,839125,717,389115,735,0001,078,00020,480
9Oct 12, 2026 20:5723,852125,889,506115,772,0001,104,00020,480