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 listSep 5, 2021 13:59Sergey StreminSergey StreminScore: 31,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2021 13:5931,1821,082,875,5821,029,022,34002,244,608
2Sep 5, 2021 14:0031,2021,098,491,3121,029,651,68202,187,264
3Sep 5, 2021 14:0031,2411,088,477,5931,030,965,01002,244,608
4Sep 5, 2021 13:5931,4551,107,307,6431,038,021,73202,220,032
5Sep 5, 2021 14:0031,7671,106,566,5021,048,325,16002,244,608
6Sep 5, 2021 13:5931,7831,106,312,6251,048,830,55602,244,608