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 27, 2026 07:45Shikhar SoniShikhar SoniScore: 32,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 07:4631,836955,084,151936,067,0009,206,0002,125,824
2Jun 27, 2026 07:4631,850955,500,684933,869,00011,375,0002,125,824
3Jun 27, 2026 07:4632,008960,267,663940,969,0009,361,0002,125,824
4Jun 27, 2026 07:4632,021960,649,059940,763,0009,479,0002,125,824
5Jun 27, 2026 07:4632,021960,646,709939,802,00010,681,0002,125,824
6Jun 27, 2026 07:4632,125963,768,924944,325,0009,606,0002,125,824
7Jun 27, 2026 07:4632,192965,766,888945,406,00010,415,0002,125,824
8Jun 27, 2026 07:4632,342970,275,408950,593,0009,738,0002,125,824
9Jun 27, 2026 07:4633,020990,603,940970,630,00010,023,0002,125,824