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:19Pavel SkripkinPavel SkripkinScore: 12,126Success
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:2011,231379,729,254367,394,0003,243,0002,121,728stderr
2May 13, 2026 19:2011,550390,709,048377,814,0003,343,0002,121,728stderr
3May 13, 2026 19:2011,784397,619,062385,581,0003,293,0002,121,728stderr
4May 13, 2026 19:2011,893402,678,177389,115,0003,362,0002,121,728stderr
5May 13, 2026 19:2012,126407,553,520396,907,0003,276,0002,121,728stderr
6May 13, 2026 19:2013,255447,065,944434,061,0003,385,0002,121,728stderr
7May 13, 2026 19:2013,705459,651,767448,820,0003,463,0002,121,728stderr
8May 13, 2026 19:2013,860466,741,099454,076,0003,324,0002,121,728stderr
9May 13, 2026 19:2013,863465,668,073454,179,0003,321,0002,121,728stderr