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:44Yuriy LyfenkoYuriy LyfenkoScore: 14,605Success
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:4413,821414,623,275901,284,09302,551,808
2Jun 6, 2021 17:4414,068422,044,230918,800,70302,449,408
3Jun 6, 2021 17:4414,300429,010,322931,621,70802,560,000
4Jun 6, 2021 17:4414,501435,040,846911,973,38602,560,000
5Jun 6, 2021 17:4414,605438,137,000927,096,07202,539,520
6Jun 6, 2021 17:4414,609438,277,297929,643,77302,416,640
7Jun 6, 2021 17:4414,681440,429,706926,302,93502,408,448
8Jun 6, 2021 17:4414,721441,637,083929,628,46702,531,328
9Jun 6, 2021 17:4414,805444,146,424931,148,49702,433,024