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:55Shikhar SoniShikhar SoniScore: 42,208Success
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:5642,1471,264,421,9661,198,832,00055,390,0002,113,536
2Jun 26, 2026 16:5642,1591,264,790,0321,199,462,00055,053,0002,113,536
3Jun 26, 2026 16:5642,1681,265,045,0491,199,628,00055,211,0002,113,536
4Jun 26, 2026 16:5642,1891,265,688,4441,200,272,00055,074,0002,113,536
5Jun 26, 2026 16:5642,2081,266,243,4591,200,667,00055,441,0002,113,536
6Jun 26, 2026 16:5642,2261,266,793,6671,201,086,00055,241,0002,113,536
7Jun 26, 2026 16:5642,2351,267,077,4241,201,591,00055,215,0002,113,536
8Jun 26, 2026 16:5642,2511,267,543,1251,201,055,00055,753,0002,113,536
9Jun 26, 2026 16:5642,2531,267,606,5311,201,882,00055,357,0002,113,536