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 8, 2026 19:43Josu San MartinJosu San MartinScore: 9,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 19:209,684342,002,169314,589,0004,993,0002,453,504
2Jan 8, 2026 19:209,713349,026,881315,545,0004,992,0002,347,008
3Jan 8, 2026 19:209,714347,658,969316,552,0003,994,0002,363,392
4Jan 8, 2026 19:209,717346,641,498317,668,0002,996,0002,334,720
5Jan 8, 2026 19:209,758347,755,082318,003,0004,000,0002,289,664
6Jan 8, 2026 19:209,767349,458,434319,297,0003,002,0002,347,008
7Jan 8, 2026 19:4310,368368,356,717340,149,0002,000,0002,334,720
8Jan 8, 2026 19:4310,398367,327,315339,145,0004,001,0002,289,664
9Jan 8, 2026 19:4310,406369,279,975340,402,0002,994,0002,289,664