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 listNov 6, 2025 15:30AntonAntonScore: 178,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2025 15:30173,507878,980,970847,184,0003,000,0002,297,856
2Nov 6, 2025 15:30173,543875,442,898848,362,0001,998,0002,437,120
3Nov 6, 2025 15:30174,842887,696,866853,729,0002,999,0002,433,024
4Nov 6, 2025 15:30178,528899,537,090871,789,0002,999,0002,306,048
5Nov 6, 2025 15:30178,775909,405,012872,997,0002,999,0002,297,856
6Nov 6, 2025 15:30179,401910,445,807877,067,0001,997,0002,289,664
7Nov 6, 2025 15:30179,563903,110,080875,859,0003,999,0002,297,856
8Nov 6, 2025 15:30180,687917,209,627883,366,0001,998,0002,547,712
9Nov 6, 2025 15:30181,155921,902,329885,661,0001,999,0002,297,856