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:37Yuriy LyfenkoYuriy LyfenkoScore: 17,793Success
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:3713,915417,442,268898,252,49002,535,424
2Jun 6, 2021 17:3717,320519,595,230985,062,64502,469,888
3Jun 6, 2021 17:3717,331519,925,042995,357,98302,543,616
4Jun 6, 2021 17:3717,402522,061,8121,002,005,44802,478,080
5Jun 6, 2021 17:3717,793533,775,8901,024,874,99202,445,312
6Jun 6, 2021 17:3717,883536,477,6981,011,535,22302,408,448
7Jun 6, 2021 17:3718,333549,997,1271,029,713,36302,555,904
8Jun 6, 2021 17:3718,548556,430,2591,026,721,90202,535,424
9Jun 6, 2021 17:3718,577557,299,6201,025,841,50202,465,792