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 18:33janwwwjanwwwScore: 34,914Success
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 18:3333,734175,808,545164,162,0001,135,0002,113,536
2Oct 9, 2026 18:3333,761176,699,251164,316,0001,115,0002,113,536
3Oct 9, 2026 18:3334,433179,352,080167,592,0001,131,0002,113,536
4Oct 9, 2026 18:3334,516180,326,783168,012,0001,118,0002,113,536
5Oct 9, 2026 18:3334,914181,749,996169,945,0001,135,0002,113,536
6Oct 9, 2026 18:3335,280183,561,820171,760,0001,115,0002,113,536
7Oct 9, 2026 18:3335,565184,819,194173,163,0001,108,0002,113,536
8Oct 9, 2026 18:3381,606410,611,344398,752,0001,118,0002,113,536
9Oct 9, 2026 18:3385,665432,477,535418,619,0001,140,0002,113,536