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 29, 2022 07:35PhibPhibScore: 112,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2022 07:29111,9053,750,156,0783,692,856,72702,240,512
2Sep 29, 2022 07:35112,1273,764,627,9373,700,193,13502,240,512
3Sep 29, 2022 07:29112,4283,765,547,6693,710,140,32402,252,800
4Sep 29, 2022 07:35112,6573,773,144,5923,717,691,15202,244,608
5Sep 29, 2022 07:29112,9193,786,715,1923,726,339,14502,240,512
6Sep 29, 2022 07:35113,6313,812,437,9063,749,839,23102,256,896