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:22Yuriy LyfenkoYuriy LyfenkoScore: 11,288Success
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:2211,062331,859,791805,871,13402,433,024
2Jun 7, 2021 16:2211,121333,639,128798,201,83202,568,192
3Jun 7, 2021 16:2211,179335,376,638803,828,37402,551,808
4Jun 7, 2021 16:2211,288338,626,551799,211,24402,416,640
5Jun 7, 2021 16:2211,487344,609,306799,345,08102,564,096
6Jun 7, 2021 16:2211,752352,570,981800,938,91702,433,024