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:54Radek SzymanskiRadek SzymanskiScore: 124,367Success
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:54123,8334,143,368,0424,086,479,98802,195,456
2Jul 5, 2023 22:08123,8774,147,486,4294,087,957,13202,273,280
3Jul 5, 2023 22:08124,3294,165,414,9044,102,861,69502,207,744
4Jul 5, 2023 21:54124,3674,157,211,1324,104,123,33202,277,376
5Jul 5, 2023 22:08125,1414,186,193,2244,129,669,09002,252,800
6Jul 5, 2023 21:54128,7644,319,228,1984,249,213,99402,297,856