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:58Shikhar SoniShikhar SoniScore: 42,272Success
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:5942,2061,266,200,0581,204,120,00052,111,0002,117,632
2Jun 26, 2026 16:5942,2271,266,830,0471,203,059,00053,698,0002,117,632
3Jun 26, 2026 16:5942,2541,267,625,5331,203,235,00054,360,0002,117,632
4Jun 26, 2026 16:5942,2681,268,068,1261,202,625,00055,385,0002,117,632
5Jun 26, 2026 16:5942,2721,268,165,2511,203,240,00054,931,0002,117,632
6Jun 26, 2026 16:5942,2761,268,309,4821,203,115,00055,202,0002,117,632
7Jun 26, 2026 16:5942,3171,269,527,4091,204,326,00054,801,0002,117,632
8Jun 26, 2026 16:5942,3201,269,611,1911,204,015,00055,386,0002,117,632
9Jun 26, 2026 16:5942,3221,269,677,6241,204,061,00055,257,0002,113,536