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 listAug 13, 2026 19:41Tomislav TunkovicTomislav TunkovicScore: 5,947Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 19:545,939204,477,000191,713,0004,292,0002,121,728stderr
2Aug 13, 2026 19:545,941204,618,534191,769,0004,315,0002,121,728stderr
3Aug 13, 2026 19:545,943204,569,120191,642,0004,488,0002,121,728stderr
4Aug 13, 2026 19:545,944206,125,421191,885,0004,299,0002,121,728stderr
5Aug 13, 2026 19:545,947204,721,214191,949,0004,303,0002,121,728stderr
6Aug 13, 2026 19:545,987206,089,162193,093,0004,481,0002,121,728stderr
7Aug 13, 2026 19:545,992206,239,490193,463,0004,305,0002,121,728stderr
8Aug 13, 2026 19:546,195212,965,761199,978,0004,480,0002,121,728stderr
9Aug 13, 2026 19:546,200212,979,056200,160,0004,465,0002,121,728stderr