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 listAug 31, 2022 07:09wireless anonwireless anonError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2022 07:0500000Error: expected "1020077 ", got "1020076"
2Aug 31, 2022 07:09103,4043,472,838,6093,412,343,93202,265,088
3Aug 31, 2022 07:09103,5603,470,716,2303,417,477,29602,269,184
4Aug 31, 2022 07:09104,1363,495,655,7023,436,474,69102,277,376