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 24, 2023 16:07matsuoka-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
1Jul 24, 2023 16:0600000Error: expected "1019487 ", got "1019486 "stderr
2Jul 24, 2023 16:0600000Error: expected "1020704 ", got "1020702 "stderr
3Jul 24, 2023 16:0700000Error: expected "1023754 ", got "1023753 "stderr
4Jul 24, 2023 16:0800000Error: expected "1024931 ", got "1024930 "stderr
5Jul 24, 2023 16:0800000Error: expected "1019133 ", got "1019131 "stderr
6Jul 24, 2023 16:0783,2462,817,362,3062,747,116,40502,256,896
7Jul 24, 2023 16:0783,7342,828,197,8392,763,224,99602,252,800
8Jul 24, 2023 16:0786,1562,911,938,2132,843,143,15402,252,800