Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listMay 16, 2026 19:51M-RochatM-RochatScore: 26,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 19:5725,736772,096,834756,105,0005,206,0002,113,536
2May 16, 2026 19:5725,790773,712,632757,893,0005,116,0002,113,536
3May 16, 2026 19:5725,809774,273,316757,440,0005,166,0002,113,536
4May 16, 2026 19:5726,132783,968,504770,128,0005,014,0002,113,536
5May 16, 2026 19:5726,183785,498,389768,504,0005,162,0002,113,536
6May 16, 2026 19:5726,345790,359,030773,078,0005,250,0002,113,536
7May 16, 2026 19:5726,398791,964,804776,293,0005,033,0002,113,536
8May 16, 2026 19:5727,152814,573,296798,434,0005,061,0002,113,536
9May 16, 2026 19:5728,901867,042,517850,921,0005,057,0002,113,536