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 listJul 31, 2025 17:44Leonardo Pedrozo AmaralLeonardo Pedrozo AmaralScore: 214,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2025 17:44212,3507,057,607,6136,700,792,000306,761,0002,465,792
2Jul 31, 2025 17:44214,1167,110,579,0436,744,050,000321,763,0002,260,992
3Jul 31, 2025 17:44214,9567,143,519,9476,797,820,000295,731,0002,269,184