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 20:49Sergey StreminSergey StreminScore: 150,030Success
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 20:49146,6414,399,219,06212,834,721,35402,486,272
2Jun 6, 2021 20:49147,9514,438,518,99812,924,681,63302,498,560
3Jun 6, 2021 20:49149,1344,474,021,33012,919,453,05202,457,600
4Jun 6, 2021 20:49149,5244,485,717,85813,014,653,23002,428,928
5Jun 6, 2021 20:49150,0304,500,903,38513,024,863,75702,510,848
6Jun 6, 2021 20:49150,2974,508,895,80613,158,091,87202,465,792
7Jun 6, 2021 20:49151,9964,559,876,14513,233,813,31302,453,504
8Jun 6, 2021 20:49152,8694,586,059,93213,198,659,48602,379,776
9Jun 6, 2021 20:49155,1404,654,188,00313,514,598,46702,404,352