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 10, 2026 20:05zielajzielajScore: 3,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 20:053,055125,809,54499,804,000998,0002,273,280
2Jan 10, 2026 20:053,099125,183,042101,275,0001,002,0002,502,656
3Jan 10, 2026 20:053,101124,856,50599,338,0003,010,0002,535,424
4Jan 10, 2026 20:053,124126,936,829100,092,0003,002,0002,412,544
5Jan 10, 2026 20:053,128123,448,164100,215,0003,006,0002,408,448
6Jan 10, 2026 20:053,156125,362,819102,143,0002,002,0002,535,424
7Jan 10, 2026 20:053,190131,290,841103,254,0002,004,0002,404,352
8Jan 10, 2026 20:053,193131,642,707103,355,0002,006,0002,412,544
9Jan 10, 2026 20:053,401136,658,195110,214,0002,003,0002,404,352