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 5, 2023 21:35Radek SzymanskiRadek SzymanskiScore: 178,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2023 21:35176,9095,891,459,9045,837,984,17002,207,744
2Jul 5, 2023 21:41177,1645,902,871,6815,846,410,89602,269,184
3Jul 5, 2023 21:41177,9785,930,012,3285,873,260,72902,191,360
4Jul 5, 2023 21:35178,6705,955,610,5615,896,108,94702,236,416
5Jul 5, 2023 21:35178,9155,975,641,4935,904,197,87902,191,360
6Jul 5, 2023 21:41179,0225,976,017,0755,907,721,44702,260,992