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 26, 2024 15:58Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2024 15:5700000Error: expected "1018972 ", got "1018971 "stderr
2Sep 26, 2024 15:5900000Error: expected "1024836 ", got "1024834 "stderr
3Sep 26, 2024 15:5830,4011,033,424,886940,270,00062,951,0002,469,888
4Sep 26, 2024 15:5830,7221,040,827,333947,829,00065,988,0002,347,008
5Sep 26, 2024 15:5830,7281,047,256,305956,086,00057,944,0002,400,256