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 17, 2026 13:13Tomislav TunkovicTomislav TunkovicScore: 3,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 13:363,220115,980,004104,246,0002,019,00032,768
2Aug 17, 2026 13:363,226116,247,822104,455,0002,020,00032,768
3Aug 17, 2026 13:363,231116,768,630104,597,0002,033,00032,768
4Aug 17, 2026 13:363,244116,754,020104,004,0003,049,00032,768
5Aug 17, 2026 13:363,244116,775,421105,034,0002,018,00032,768
6Aug 17, 2026 13:363,248117,276,463105,187,0002,024,00032,768
7Aug 17, 2026 13:363,249117,024,725105,222,0002,026,00032,768
8Aug 17, 2026 13:363,305123,428,925106,998,0002,082,00032,768
9Aug 17, 2026 13:363,307121,700,592107,123,0002,032,00032,768