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 19:05Josu San MartinJosu San MartinScore: 12,626Success
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 19:0512,618442,587,154414,393,0001,997,0002,289,664
2Jan 8, 2026 19:0512,621441,659,620413,511,0002,996,0002,355,200
3Jan 8, 2026 19:0512,626449,679,829413,656,0002,997,0002,342,912
4Jan 8, 2026 19:0512,626443,375,509413,673,0002,997,0002,347,008
5Jan 8, 2026 19:0512,691448,663,973416,791,0001,998,0002,347,008
6Jan 8, 2026 19:0512,720446,348,582416,759,0002,998,0002,465,792