Unique strings Sergey Svistunov

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 listDec 16, 2025 11:10AndreiAndreiScore: 116,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2025 11:10115,1573,834,267,8123,730,218,00069,947,0002,535,424
2Dec 16, 2025 11:10116,9493,890,854,4083,778,359,00080,943,0002,543,616
3Dec 16, 2025 11:10117,4633,904,998,3293,792,353,00083,941,0002,428,928