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 listNov 3, 2025 06:38vonqovonqoScore: 490,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2025 06:38488,24216,144,988,50916,017,061,00094,941,0002,351,104
2Nov 3, 2025 06:38489,60516,198,284,62916,054,019,000102,942,0002,461,696
3Nov 3, 2025 06:38489,63916,199,188,87816,068,143,00089,950,0002,400,256
4Nov 3, 2025 06:38490,12116,209,690,23016,090,038,00083,953,0002,342,912
5Nov 3, 2025 06:38490,62916,235,883,87716,110,808,00079,939,0002,449,408
6Nov 3, 2025 06:38491,06016,241,061,97916,099,042,000105,934,0002,334,720
7Nov 3, 2025 06:38491,41016,257,027,69616,128,566,00087,948,0002,420,736
8Nov 3, 2025 06:38491,65416,260,267,33016,123,650,000100,941,0002,371,584
9Nov 3, 2025 06:38495,39916,389,734,35616,250,234,00097,935,0002,416,640