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 6, 2026 07:43Karthik ReddyKarthik ReddyScore: 1,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 07:441,46844,048,947102,711,0001,017,000319,488
2Oct 6, 2026 07:441,47044,106,065102,749,0001,117,000319,488
3Oct 6, 2026 07:441,47044,118,551102,968,0001,100,000319,488
4Oct 6, 2026 07:441,47244,171,285103,089,0001,103,000319,488
5Oct 6, 2026 07:441,47444,233,412103,327,0001,006,000319,488
6Oct 6, 2026 07:441,47544,260,497103,435,0001,004,000319,488
7Oct 6, 2026 07:441,48044,420,808103,701,0001,107,000319,488
8Oct 6, 2026 07:441,48144,454,738103,809,0001,133,000319,488
9Oct 6, 2026 07:441,51745,527,134103,088,0001,008,000319,488