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 4, 2026 17:52zielajzielajScore: 3,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 17:513,090127,124,827100,987,000999,0002,453,504
2Jan 4, 2026 17:513,147129,507,239101,856,0001,997,0002,273,280
3Jan 4, 2026 18:013,160131,215,778102,290,0002,005,0002,269,184
4Jan 4, 2026 17:523,187127,326,618103,172,0002,003,0002,531,328
5Jan 4, 2026 18:013,205134,243,054102,763,0002,993,0002,408,448
6Jan 4, 2026 18:013,217128,242,241105,148,0001,001,0002,420,736
7Jan 4, 2026 17:513,253131,709,585106,352,0001,003,0002,420,736
8Jan 4, 2026 17:523,255125,756,571106,401,0001,003,0002,420,736
9Jan 4, 2026 17:523,298128,454,988106,805,0002,015,0002,412,544