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 listJan 5, 2026 07:41Павел РатмановПавел РатмановScore: 169,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 07:45157,1355,222,251,6875,160,488,00024,978,0002,383,872
2Jan 5, 2026 07:41159,0295,282,591,1695,218,981,00028,972,0002,285,568
3Jan 5, 2026 07:45161,8695,381,487,8445,314,723,00026,968,0002,285,568
4Jan 5, 2026 07:41169,1115,616,124,4395,555,709,00024,967,0002,285,568
5Jan 5, 2026 07:45169,8125,638,026,7295,575,824,00027,964,0002,277,376
6Jan 5, 2026 07:41173,1235,752,972,7295,686,093,00026,953,0002,285,568