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 18, 2026 01:26M-RochatM-RochatScore: 113,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:27111,998558,949,360547,657,0001,136,0002,113,536
2May 18, 2026 01:27112,148562,316,789548,397,0001,132,0002,113,536
3May 18, 2026 01:27112,651562,985,324550,850,0001,143,0002,113,536
4May 18, 2026 01:27113,301565,027,988554,040,0001,139,0002,113,536
5May 18, 2026 01:27113,391567,803,358554,489,0001,128,0002,113,536
6May 18, 2026 01:27113,425568,803,057554,626,0001,157,0002,113,536
7May 18, 2026 01:27115,705577,413,556565,831,0001,126,0002,113,536
8May 18, 2026 01:27116,242580,477,532568,452,0001,138,0002,113,536
9May 18, 2026 01:27116,498582,730,566569,703,0001,138,0002,113,536