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 listMay 13, 2026 19:08Pavel SkripkinPavel SkripkinScore: 11,623Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 19:0911,553389,505,124378,230,0003,044,0002,117,632
2May 13, 2026 19:0911,559389,368,599378,427,0003,052,0002,117,632
3May 13, 2026 19:0911,613392,486,210380,089,0003,160,0002,117,632
4May 13, 2026 19:0911,622392,369,364380,371,0003,180,0002,117,632
5May 13, 2026 19:0911,623392,918,363380,444,0003,129,0002,117,632
6May 13, 2026 19:0911,735394,592,764384,098,0003,168,0002,117,632
7May 13, 2026 19:0911,825399,251,741387,095,0003,144,0002,117,632
8May 13, 2026 19:0912,228412,377,080400,348,0003,188,0002,117,632
9May 13, 2026 19:0913,024439,305,459426,679,0003,141,0002,117,632