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 16, 2025 11:49AndreiAndreiScore: 162,023Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 16, 2025 11:49160,4584,813,729,22513,684,355,000398,111,0002,736,128
2Dec 16, 2025 11:49161,2484,837,436,42513,695,272,000374,901,0002,727,936
3Dec 16, 2025 11:49161,7234,851,682,92413,766,474,000359,151,0002,723,840
4Dec 16, 2025 11:49161,9464,858,383,29513,727,781,000387,784,0002,691,072
5Dec 16, 2025 11:49162,0234,860,703,37713,833,694,000353,769,0002,736,128
6Dec 16, 2025 11:49162,1414,864,238,14713,793,305,000378,142,0002,924,544
7Dec 16, 2025 11:49165,9434,978,300,57014,184,187,000384,373,0002,682,880
8Dec 16, 2025 11:49168,2215,046,639,26014,355,011,000387,946,0002,875,392
9Dec 16, 2025 11:49168,7475,062,406,64614,405,231,000412,510,0002,531,328