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 6, 2021 17:47Yuriy 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 6, 2021 17:4700000Error: expected "919574 ", got "910851 "
2Jun 6, 2021 17:5313,500404,988,201877,989,02602,564,096
3Jun 6, 2021 17:5314,024420,726,952911,638,87302,543,616
4Jun 6, 2021 17:5314,097422,902,441907,574,06502,420,736
5Jun 6, 2021 17:5314,356430,674,448911,174,66002,367,488
6Jun 6, 2021 17:5314,362430,856,104912,765,34802,539,520
7Jun 6, 2021 17:5314,375431,255,862915,146,82302,465,792
8Jun 6, 2021 17:5314,395431,850,588908,553,90702,441,216
9Jun 6, 2021 17:5314,764442,914,495888,299,55402,428,928
10Jun 6, 2021 17:5314,801444,023,050913,978,89002,424,832