Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 7, 2021 21:37Yuriy 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 7, 2021 21:3700000Error: expected "1041496 ", got "1041494 "
2Jun 7, 2021 21:3800000Error: expected "1037027 ", got "1037029 "
3Jun 7, 2021 21:3800000Error: expected "1036816 ", got "1036817 "
4Jun 7, 2021 21:3900000Error: expected "1039386 ", got "1039385 "
5Jun 7, 2021 21:3900000Error: expected "1040456 ", got "1040457 "
6Jun 7, 2021 21:398,846265,371,839582,590,24702,420,736
7Jun 7, 2021 21:398,873266,188,421583,496,77302,600,960
8Jun 7, 2021 21:399,103273,075,309581,421,89902,662,400