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 7, 2026 14:07zielajzielajScore: 3,184Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 14:073,106121,984,761101,497,0001,004,0002,404,352
2Jan 7, 2026 14:093,146131,655,089102,817,000998,0002,273,280
3Jan 7, 2026 14:093,176133,006,599102,812,0001,996,0002,535,424
4Jan 7, 2026 14:073,184126,591,278103,086,0002,001,0002,535,424
5Jan 7, 2026 14:093,196126,675,364102,450,0003,013,0002,412,544
6Jan 7, 2026 14:073,208126,279,131104,882,000998,0002,273,280