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 5, 2026 23:34zielajzielajScore: 3,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 23:363,240114,893,616104,820,0002,103,0002,121,728stderr
2Jul 5, 2026 23:363,256115,485,066105,302,0002,151,0002,121,728stderr
3Jul 5, 2026 23:363,256115,468,227105,243,0002,216,0002,121,728stderr
4Jul 5, 2026 23:363,274116,090,834105,846,0002,211,0002,121,728stderr
5Jul 5, 2026 23:363,280116,242,690106,035,0002,228,0002,121,728stderr
6Jul 5, 2026 23:363,298116,962,421106,623,0002,225,0002,121,728stderr
7Jul 5, 2026 23:363,328117,841,879107,618,0002,214,0002,121,728stderr
8Jul 5, 2026 23:363,348118,504,546108,154,0002,344,0002,121,728stderr
9Jul 5, 2026 23:363,368119,227,146108,954,0002,218,0002,121,728stderr