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 8, 2025 19:53Rajarshi BasuRajarshi BasuScore: 134,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 19:53131,4794,367,477,2144,320,823,00017,990,0002,465,792
2Dec 8, 2025 19:53132,9794,413,960,4684,373,317,00014,990,0002,396,160
3Dec 8, 2025 19:53133,3914,435,600,7814,378,908,00022,983,0002,523,136
4Dec 8, 2025 19:53134,6154,470,291,8784,419,300,00022,985,0002,408,448
5Dec 8, 2025 19:53134,7124,473,347,7314,424,518,00020,988,0002,273,280
6Dec 8, 2025 19:53135,3704,494,030,1224,449,215,00017,988,0002,469,888
7Dec 8, 2025 19:53135,4234,497,124,8754,447,976,00020,985,0002,473,984
8Dec 8, 2025 19:53135,5014,504,679,9874,454,549,00016,990,0002,281,472
9Dec 8, 2025 19:53135,7424,508,642,5574,464,494,00014,991,0002,392,064