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 listDec 6, 2024 20:58Joad NacerJoad NacerError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2024 20:5700000Error: No answer to stdout. Died or killed?stderr
2Dec 6, 2024 20:584,084122,530,071181,195,0003,003,0002,691,072
3Dec 6, 2024 20:564,251127,536,757200,470,0004,986,0002,605,056
4Dec 6, 2024 20:564,284128,516,345201,880,0005,047,0002,605,056
5Dec 6, 2024 20:574,585137,537,705217,394,0005,009,0002,613,248
6Dec 6, 2024 20:574,609138,282,210218,731,0006,020,0002,760,704
7Dec 6, 2024 20:564,632138,972,750219,047,0003,000,0002,363,392
8Dec 6, 2024 20:584,684140,528,759214,062,0004,001,0002,363,392
9Dec 6, 2024 20:574,721141,636,683222,123,0002,001,0002,637,824
10Dec 6, 2024 20:584,962148,858,751217,194,0005,004,0002,592,768