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 7, 2021 20:22piculpiculScore: 26,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2021 20:2226,334930,447,298869,014,26902,203,648
2Sep 7, 2021 20:2026,379943,106,171870,497,32502,183,168
3Sep 7, 2021 20:2026,403929,455,570871,313,62402,199,552
4Sep 7, 2021 20:2226,417934,604,173871,757,81502,195,456
5Sep 7, 2021 20:2226,543941,392,946875,913,98202,195,456
6Sep 7, 2021 20:2026,572945,211,559876,880,38202,187,264