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 listJun 19, 2024 04:30matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2024 04:3000000Error: expected "1024106 ", got "1024105 "stderr
2Jun 19, 2024 04:3000000Error: expected "1019155 ", got "1019154 "stderr
3Jun 19, 2024 04:3100000Error: expected "1022115 ", got "1022114 "stderr
4Jun 19, 2024 04:3200000Error: expected "1026947 ", got "1026946 "stderr
5Jun 19, 2024 04:3200000Error: expected "1020388 ", got "1020387 "stderr
6Jun 19, 2024 04:304,850227,916,462160,047,29902,228,224
7Jun 19, 2024 04:304,859215,690,618160,360,29102,232,320
8Jun 19, 2024 04:304,900220,807,656161,701,38402,224,128