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 16:45Yuriy 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 16:4500000Error: expected "1034367 ", got "1034366 "
2Jun 7, 2021 16:4600000Error: expected "1042087 ", got "1042086 "
3Jun 7, 2021 16:468,874266,217,064610,810,64602,486,272
4Jun 7, 2021 16:469,262277,868,037622,196,48002,351,104
5Jun 7, 2021 16:469,430282,886,522611,367,37602,347,008
6Jun 7, 2021 16:469,762292,865,234623,235,31502,469,888
7Jun 7, 2021 16:4610,009300,260,442618,916,79602,506,752
8Jun 7, 2021 16:4610,719321,568,388621,183,41302,478,080