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 12, 2026 03:14Josu San MartinJosu San MartinScore: 4,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 03:094,394170,623,471143,018,0002,000,0002,289,664
2Jan 12, 2026 03:094,408173,207,551144,455,0001,003,0002,289,664
3Jan 12, 2026 03:034,413171,585,023143,625,0001,994,0002,289,664
4Jan 12, 2026 03:034,459169,879,876146,143,0001,000,0002,289,664
5Jan 12, 2026 03:094,468176,355,752147,452,00002,396,160
6Jan 12, 2026 03:144,473173,277,659146,612,000997,0002,289,664
7Jan 12, 2026 03:144,475176,536,898145,683,0001,995,0002,289,664
8Jan 12, 2026 03:034,478176,119,089146,765,000998,0002,289,664
9Jan 12, 2026 03:144,484171,938,826146,978,000999,0002,404,352