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:20Yuriy LyfenkoYuriy LyfenkoScore: 11,473Success
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:2011,046331,371,877816,151,76702,465,792
2Jun 7, 2021 16:2011,302339,060,040812,754,29702,473,984
3Jun 7, 2021 16:2011,428342,835,667811,321,36602,445,312
4Jun 7, 2021 16:2011,473344,201,561850,161,99502,387,968
5Jun 7, 2021 16:2011,637349,114,955815,006,58802,461,696
6Jun 7, 2021 16:2012,003360,092,252817,539,00702,318,336