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 listApr 23, 2024 01:06Joad NacerJoad NacerScore: 29,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2024 01:0629,429882,872,120822,865,43402,306,048
2Apr 18, 2024 00:4229,455883,658,667823,335,83302,433,024
3Apr 18, 2024 00:4229,626888,773,270827,563,67602,424,832
4Apr 23, 2024 01:0629,755892,640,089828,961,10702,412,544
5Apr 23, 2024 01:0630,191905,718,705835,280,83502,420,736
6Apr 18, 2024 00:4230,379911,363,902826,866,85002,310,144