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 listJan 8, 2026 03:01Josu San MartinJosu San MartinScore: 45,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 03:0144,5831,499,637,3361,463,242,0007,995,0002,420,736
2Jan 8, 2026 03:0145,0571,513,807,4961,478,880,0007,993,0002,494,464
3Jan 8, 2026 03:0146,5201,569,631,4761,526,158,0008,989,0002,359,296