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 listMar 31, 2026 13:51Dominique GarmierDominique GarmierScore: 135,938Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 13:51131,9929,431,482,1441,498,820,0002,856,906,0002,412,544
2Mar 31, 2026 13:51135,9389,984,204,3781,454,218,0003,031,745,0002,543,616
3Mar 31, 2026 13:51139,2079,402,638,1671,516,455,0003,077,392,0002,465,792