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 listOct 9, 2026 08:17Karthik ReddyKarthik ReddyScore: 1,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 09:321,44843,453,163101,106,0001,008,000323,584
2Oct 9, 2026 09:321,45643,696,597102,036,0001,012,000323,584
3Oct 9, 2026 09:321,46844,041,099103,035,0001,004,00057,344
4Oct 9, 2026 09:321,47044,105,638103,250,0001,117,00057,344
5Oct 9, 2026 09:321,47044,118,548103,116,0001,004,00057,344
6Oct 9, 2026 09:321,47644,287,178103,773,0001,004,000323,584
7Oct 9, 2026 09:321,47644,286,969103,609,0001,004,000323,584
8Oct 9, 2026 09:321,47844,366,522103,916,0001,004,00057,344
9Oct 9, 2026 09:321,47944,386,561104,060,0001,004,000323,584