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 listJul 31, 2026 19:32anboto1anboto1Score: 188,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 19:33188,676935,316,517922,425,0002,089,0002,113,536
2Jul 31, 2026 19:33188,688935,947,727923,492,0001,080,0002,113,536
3Jul 31, 2026 19:33188,758934,987,531923,778,0001,140,0002,113,536
4Jul 31, 2026 19:33188,814935,117,329924,109,0001,081,0002,113,536
5Jul 31, 2026 19:33188,831935,322,831924,192,0001,082,0002,113,536
6Jul 31, 2026 19:33188,831935,213,319924,200,0001,073,0002,113,536
7Jul 31, 2026 19:33188,867935,391,581924,366,0001,087,0002,113,536
8Jul 31, 2026 19:33188,881935,481,703924,437,0001,080,0002,113,536
9Jul 31, 2026 19:33188,930935,786,888924,677,0001,083,0002,113,536