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 15:57wnwnScore: 98,587Success
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 15:5898,496491,719,005481,626,0001,005,0002,113,536
2May 11, 2026 15:5898,518491,302,769481,739,0001,004,0002,113,536
3May 11, 2026 15:5898,582490,369,244482,049,0001,004,0002,113,536
4May 11, 2026 15:5898,583493,207,118482,052,0001,005,0002,113,536
5May 11, 2026 15:5898,587490,551,231482,076,0001,003,0002,113,536
6May 11, 2026 15:5898,593490,882,585481,064,0002,045,0002,113,536
7May 11, 2026 15:5898,608490,744,921482,175,0001,005,0002,113,536
8May 11, 2026 15:58100,466499,683,500491,284,0001,004,0002,113,536
9May 11, 2026 15:58100,673501,154,482492,294,0001,004,0002,113,536