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 6, 2026 23:18Pavel SamyginPavel SamyginScore: 15,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 23:1915,178523,365,282487,893,00012,970,0002,383,872
2Mar 6, 2026 23:1815,406530,685,853491,415,00016,979,0002,392,064
3Mar 6, 2026 23:1915,750547,119,587498,747,00020,989,0002,297,856
4Mar 6, 2026 23:1815,819550,542,897497,068,00024,953,0002,400,256
5Mar 6, 2026 23:1915,870557,911,649501,722,00021,987,0002,301,952
6Mar 6, 2026 23:1815,889559,340,911502,372,00021,972,0002,502,656