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 listSep 6, 2026 16:42NoSIMD_C#NoSIMD_C#Score: 257,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 16:45257,5521,271,871,9141,143,052,000118,954,0002,142,208
2Sep 6, 2026 16:45257,7131,275,628,3141,144,181,000118,614,0002,142,208
3Sep 6, 2026 16:45257,7481,272,826,2941,142,998,000119,968,0002,142,208
4Sep 6, 2026 16:45257,8851,274,770,2121,142,442,000121,198,0002,162,688
5Sep 6, 2026 16:45257,8911,273,545,6281,143,475,000120,192,0002,142,208
6Sep 6, 2026 16:45258,0011,273,980,7391,143,022,000121,183,0002,203,648
7Sep 6, 2026 16:45258,5411,276,679,8411,145,206,000121,648,0002,142,208
8Sep 6, 2026 16:45258,7161,277,477,2171,145,819,000121,892,0002,142,208
9Sep 6, 2026 16:45258,9861,278,816,7421,144,762,000124,273,0002,203,648