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 8, 2021 15:08Yuriy 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
1Jun 8, 2021 15:0800000Error: expected "1039077 ", got "1039074 "
2Jun 8, 2021 15:0900000Error: expected "1036173 ", got "1036171 "
3Jun 8, 2021 15:0900000Error: expected "1041926 ", got "1041924 "
4Jun 8, 2021 15:1100000Error: expected "1036210 ", got "1036209 "
5Jun 8, 2021 15:1100000Error: expected "1039890 ", got "1039887 "
6Jun 8, 2021 15:1100000Error: expected "1034712 ", got "1034711 "
7Jun 8, 2021 15:1100000Error: expected "1041627 ", got "1041626 "
8Jun 8, 2021 15:109,988395,582,928329,589,62402,260,992
9Jun 8, 2021 15:109,993400,553,580329,761,22102,265,088
10Jun 8, 2021 15:1010,194402,240,449336,408,35702,256,896