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 listOct 2, 2024 18:55Joad NacerJoad NacerScore: 4,845Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2024 18:554,523135,682,903213,319,0003,987,0002,641,920
2Oct 2, 2024 18:554,556136,684,997218,381,0004,007,0002,555,904
3Oct 2, 2024 18:554,743142,276,881230,969,0002,999,0002,801,664
4Oct 2, 2024 18:554,749142,476,487223,812,0003,010,0002,560,000
5Oct 2, 2024 18:554,845145,351,551236,416,0002,003,0002,592,768
6Oct 2, 2024 18:554,940148,202,827232,204,0004,003,0002,605,056
7Oct 2, 2024 18:554,973149,180,138226,553,0004,009,0002,596,864
8Oct 2, 2024 18:555,036151,071,383219,883,0005,020,0002,633,728
9Oct 2, 2024 18:555,043151,287,330226,058,0004,001,0002,699,264