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 24, 2025 21:19zielajzielajScore: 3,817Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2025 21:193,798146,590,311117,314,0008,021,0002,469,888
2Dec 24, 2025 21:193,808157,740,353118,672,0006,980,0002,523,136
3Dec 24, 2025 21:193,809155,386,299113,717,00011,970,0002,424,832
4Dec 24, 2025 21:193,816147,973,300117,936,0007,995,0002,420,736
5Dec 24, 2025 21:193,817157,045,877115,963,0009,996,0002,351,104
6Dec 24, 2025 21:193,823146,716,759117,158,0009,012,0002,392,064
7Dec 24, 2025 21:193,825144,348,554116,197,00010,017,0002,400,256
8Dec 24, 2025 21:193,853149,993,914114,124,00013,014,0002,375,680
9Dec 24, 2025 21:193,862154,682,990117,407,00010,034,0002,392,064