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 listDec 19, 2025 19:05Rajarshi BasuRajarshi BasuScore: 5,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 19:055,820216,095,807186,060,0006,001,0002,494,464
2Dec 19, 2025 19:055,855216,999,859187,203,0006,006,0002,514,944
3Dec 19, 2025 19:055,892223,014,354190,433,0004,009,0002,301,952
4Dec 19, 2025 19:055,901214,734,170187,735,0006,990,0002,523,136
5Dec 19, 2025 19:055,908218,044,865187,976,0006,999,0002,367,488
6Dec 19, 2025 19:055,916222,516,796189,224,0006,007,0002,449,408
7Dec 19, 2025 19:055,957227,995,624190,610,0005,987,0002,506,752
8Dec 19, 2025 19:056,151224,659,088198,980,0003,999,0002,342,912
9Dec 19, 2025 19:056,157229,937,972197,168,0006,005,0002,486,272