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 listMay 11, 2026 08:13wnwnScore: 111,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 08:14108,047540,059,263526,241,0003,192,0002,113,536
2May 11, 2026 08:14108,162539,416,038526,987,0003,010,0002,113,536
3May 11, 2026 08:14108,171539,692,286527,028,0003,010,0002,113,536
4May 11, 2026 08:14108,766542,582,157529,947,0003,011,0002,113,536
5May 11, 2026 08:14111,582556,407,981543,591,0003,164,0002,113,536
6May 11, 2026 08:14111,675556,857,625544,180,0003,028,0002,113,536
7May 11, 2026 08:14114,920573,721,702559,980,0003,128,0002,113,536
8May 11, 2026 08:14114,938572,543,476560,197,0003,004,0002,113,536
9May 11, 2026 08:14114,949574,766,690560,248,0003,004,0002,113,536