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 17, 2025 22:03Aniruddha DebAniruddha DebScore: 33,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2025 22:0332,8981,108,839,7181,073,648,00011,996,0002,519,040
2Jun 17, 2025 22:0332,9501,109,273,0811,076,358,00010,993,0002,363,392
3Jun 17, 2025 22:0333,0411,110,459,5701,075,349,00014,990,0002,359,296
4Jun 17, 2025 22:0333,2361,129,340,8851,084,800,00011,997,0002,392,064
5Jun 17, 2025 22:0333,2431,127,893,0201,087,023,0009,991,0002,269,184
6Jun 17, 2025 22:0334,1691,153,689,7361,117,578,0009,996,0002,269,184