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 listJul 1, 2021 17:02Igor ShekalevIgor ShekalevScore: 108,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2021 17:30108,3053,650,567,6713,574,066,51002,260,992
2Jul 1, 2021 17:30108,6073,656,221,8163,584,035,88702,228,224
3Jul 1, 2021 17:02108,6833,648,519,9503,586,537,22302,203,648
4Jul 1, 2021 17:02108,7923,643,717,8853,590,125,49402,211,840
5Jul 1, 2021 17:30108,7963,648,569,5163,590,260,66202,306,048
6Jul 1, 2021 17:02109,2413,674,055,5273,604,937,09602,215,936