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 listJun 24, 2026 20:57nunnunScore: 200,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 20:59198,4886,559,797,5086,401,828,000148,288,0002,117,632
2Jun 24, 2026 20:59199,5896,595,987,2356,438,538,000147,929,0002,117,632
3Jun 24, 2026 20:59199,7206,600,082,0296,438,567,000152,198,0002,117,632
4Jun 24, 2026 20:59200,0476,611,195,7926,450,833,000150,733,0002,117,632
5Jun 24, 2026 20:59200,7906,635,368,0206,475,063,000151,021,0002,117,632
6Jun 24, 2026 20:59201,2816,651,575,3066,490,809,000151,492,0002,117,632
7Jun 24, 2026 20:59201,6986,665,314,9576,506,764,000149,283,0002,117,632
8Jun 24, 2026 20:59202,1376,679,880,1896,519,558,000150,963,0002,117,632
9Jun 24, 2026 20:59214,8337,099,256,3146,937,377,000152,144,0002,117,632