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 listNov 11, 2024 06:58E SequeiraE SequeiraScore: 121,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 06:58120,0833,602,498,3773,560,556,00015,989,0002,560,000
2Nov 11, 2024 06:58120,3053,609,139,6143,564,851,00012,992,0002,629,632
3Nov 11, 2024 06:58120,3933,611,797,3923,563,292,00015,987,0002,703,360
4Nov 11, 2024 06:58120,7563,622,678,1223,581,729,0009,993,0002,543,616
5Nov 11, 2024 06:58121,0323,630,962,3343,586,538,00013,986,0002,772,992
6Nov 11, 2024 06:58121,4183,642,551,5483,595,431,00015,988,0002,543,616
7Nov 11, 2024 06:58121,7063,651,184,3383,605,071,00010,991,0002,543,616
8Nov 11, 2024 06:58121,9013,657,028,9313,610,337,00011,991,0002,756,608
9Nov 11, 2024 06:58121,9923,659,753,1353,612,835,00013,991,0002,543,616