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 11:11wnwnScore: 103,688Success
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 11:12103,534516,021,139506,276,0001,044,0002,113,536
2May 11, 2026 11:12103,544516,101,429506,335,0001,035,0002,113,536
3May 11, 2026 11:12103,593516,858,810506,470,0001,137,0002,113,536
4May 11, 2026 11:12103,673517,170,355506,823,0001,177,0002,113,536
5May 11, 2026 11:12103,688518,711,490507,070,0001,002,0002,113,536
6May 11, 2026 11:12104,101518,962,103508,970,0001,127,0002,113,536
7May 11, 2026 11:12104,112519,577,206509,025,0001,124,0002,113,536
8May 11, 2026 11:12104,150519,132,252509,228,0001,108,0002,113,536
9May 11, 2026 11:12105,124523,826,391514,052,0001,058,0002,113,536