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:43Yuriy LyfenkoYuriy LyfenkoError
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:4300000Error: expected "1041280 ", got "1041279 "
2Jun 7, 2021 17:0100000Error: expected "1039171 ", got "1039170 "
3Jun 7, 2021 17:007,629228,863,304508,471,28502,318,336
4Jun 7, 2021 16:437,721231,635,712508,613,20302,416,640
5Jun 7, 2021 17:007,839235,163,898510,528,65902,543,616
6Jun 7, 2021 16:437,880236,397,128511,640,66402,416,640
7Jun 7, 2021 17:008,050241,500,685510,848,82102,560,000
8Jun 7, 2021 17:008,198245,925,323507,449,63702,551,808
9Jun 7, 2021 17:008,199245,970,667508,262,42402,572,288
10Jun 7, 2021 17:008,217246,498,621506,913,53902,404,352
11Jun 7, 2021 16:438,501255,018,104511,498,81902,433,024