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 2, 2026 12:09Rajarshi BasuRajarshi BasuScore: 3,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 12:093,408142,241,870109,458,0003,012,0002,285,568
2Jan 2, 2026 12:093,413133,273,908109,630,0002,989,0002,387,968
3Jan 2, 2026 12:093,420134,443,467109,861,0002,996,0002,285,568
4Jan 2, 2026 12:093,422136,989,945109,932,0002,998,0002,285,568
5Jan 2, 2026 12:093,431136,078,373111,214,0002,003,0002,285,568
6Jan 2, 2026 12:093,436138,702,888110,394,0003,010,0002,285,568
7Jan 2, 2026 12:093,509137,563,107113,809,0001,996,0002,387,968
8Jan 2, 2026 12:093,537139,027,061114,737,0001,995,0002,285,568
9Jan 2, 2026 12:093,543144,729,054113,925,0002,998,0002,502,656