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:23M-RochatM-RochatScore: 113,359Success
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:23112,165560,502,906548,464,0001,148,0002,113,536
2May 18, 2026 01:23113,200564,573,124553,554,0001,129,0002,113,536
3May 18, 2026 01:23113,282565,291,431553,948,0001,134,0002,113,536
4May 18, 2026 01:23113,321566,413,366554,135,0001,138,0002,113,536
5May 18, 2026 01:23113,359566,655,419554,310,0001,150,0002,113,536
6May 18, 2026 01:23116,123579,217,100567,886,0001,119,0002,113,536
7May 18, 2026 01:23116,332584,732,606568,886,0001,143,0002,113,536
8May 18, 2026 01:23116,381581,970,781569,141,0001,128,0002,113,536
9May 18, 2026 01:23140,478699,503,921687,206,0001,139,0002,113,536