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 20, 2025 14:47Rajarshi BasuRajarshi BasuScore: 5,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 14:475,080193,953,090162,646,0004,989,0002,445,312
2Dec 20, 2025 14:475,090189,442,159163,977,0003,999,0002,314,240
3Dec 20, 2025 14:475,106195,081,421160,517,0007,976,0002,289,664
4Dec 20, 2025 14:475,119191,058,531163,925,0004,997,0002,392,064
5Dec 20, 2025 14:475,121194,778,886164,997,0003,999,0002,523,136
6Dec 20, 2025 14:475,175201,818,579164,777,0005,991,0002,379,776