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 7, 2026 04:18Karthik ReddyKarthik ReddyScore: 24,319Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 7, 2026 04:1924,297128,437,969117,955,0001,104,0002,113,536
2Oct 7, 2026 04:1924,301128,127,346117,950,0001,129,0002,113,536
3Oct 7, 2026 04:1924,312128,156,866118,096,0001,033,0002,113,536
4Oct 7, 2026 04:1924,313128,123,366118,036,0001,100,0002,113,536
5Oct 7, 2026 04:1924,319128,201,867118,127,0001,038,0002,113,536
6Oct 7, 2026 04:1924,320128,263,636118,138,0001,031,0002,113,536
7Oct 7, 2026 04:1924,334128,277,712118,129,0001,108,0002,113,536
8Oct 7, 2026 04:1924,356128,400,556118,319,0001,026,0002,113,536
9Oct 7, 2026 04:1924,387128,516,770118,471,0001,027,0002,113,536