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:56Joad NacerJoad NacerScore: 4,592Success
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:564,388131,636,346211,434,0003,006,0002,609,152
2Dec 6, 2024 20:564,476134,266,208212,124,0002,001,0002,596,864
3Dec 6, 2024 20:564,481134,420,506203,183,0006,005,0002,396,160
4Dec 6, 2024 20:564,541136,222,329220,257,0004,004,0002,367,488
5Dec 6, 2024 20:564,592137,750,808212,705,0004,993,0002,363,392
6Dec 6, 2024 20:564,656139,688,133214,401,0006,011,0002,404,352
7Dec 6, 2024 20:564,677140,312,891217,512,0003,991,0002,658,304
8Dec 6, 2024 20:564,695140,855,369218,238,0003,003,0002,367,488
9Dec 6, 2024 20:564,721141,633,108220,986,0002,999,0002,572,288