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:42Yuriy LyfenkoYuriy LyfenkoScore: 34,568Success
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:4234,1671,025,014,6002,276,301,60102,433,024
2Jun 6, 2021 17:4234,3221,029,667,9952,273,838,01002,433,024
3Jun 6, 2021 17:4234,3331,029,976,5202,277,050,69302,539,520
4Jun 6, 2021 17:4234,5081,035,237,5242,277,774,21902,568,192
5Jun 6, 2021 17:4234,5681,037,036,6602,271,821,47702,437,120
6Jun 6, 2021 17:4234,6061,038,172,0122,276,733,47802,437,120
7Jun 6, 2021 17:4234,6961,040,866,4152,269,801,10802,465,792
8Jun 6, 2021 17:4234,8781,046,352,4282,276,631,84002,465,792
9Jun 6, 2021 17:4235,3941,061,816,0622,278,512,45202,416,640