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 listJun 26, 2026 16:57Shikhar SoniShikhar SoniScore: 42,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 16:5842,4031,272,113,0571,205,945,00055,748,0002,113,536
2Jun 26, 2026 16:5842,4161,272,494,6381,206,769,00055,553,0002,113,536
3Jun 26, 2026 16:5842,4391,273,198,6061,207,390,00055,630,0002,113,536
4Jun 26, 2026 16:5842,4551,273,676,1051,206,031,00055,446,0002,113,536
5Jun 26, 2026 16:5842,4681,274,041,1821,208,544,00055,346,0002,113,536
6Jun 26, 2026 16:5842,4841,274,523,9171,207,966,00055,817,0002,113,536
7Jun 26, 2026 16:5842,4841,274,532,4261,207,839,00056,514,0002,113,536
8Jun 26, 2026 16:5842,5001,275,026,0881,208,511,00055,646,0002,113,536
9Jun 26, 2026 16:5842,5341,276,028,5851,208,424,00055,924,0002,113,536