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 listOct 17, 2026 22:47e1011e1011Score: 38,408Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 22:4837,8991,261,766,0561,240,994,0009,689,0002,113,536
2Oct 17, 2026 22:4838,0011,265,122,8561,244,610,0009,453,0002,113,536
3Oct 17, 2026 22:4838,0301,266,212,5861,245,179,0009,814,0002,113,536
4Oct 17, 2026 22:4838,0741,267,417,7221,246,924,0009,550,0002,113,536
5Oct 17, 2026 22:4838,4081,279,136,2881,257,933,0009,544,0002,113,536
6Oct 17, 2026 22:4838,4781,280,989,8651,260,051,0009,733,0002,113,536
7Oct 17, 2026 22:4838,5581,283,426,0811,262,530,0009,891,0002,113,536
8Oct 17, 2026 22:4838,6401,286,214,1991,265,376,0009,755,0002,113,536
9Oct 17, 2026 22:4838,7811,300,595,5661,270,177,0009,628,0002,113,536