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 22:53janwwwjanwwwScore: 10,086Success
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 22:5510,057301,716,960148,948,0002,091,0002,113,536
2Oct 9, 2026 22:5510,064301,928,579149,082,0002,103,0002,113,536
3Oct 9, 2026 22:5510,074302,246,066149,389,0002,131,0002,113,536
4Oct 9, 2026 22:5510,076302,299,409149,323,0002,097,0002,113,536
5Oct 9, 2026 22:5510,086302,590,527149,714,0002,107,0002,113,536
6Oct 9, 2026 22:5510,089302,684,064149,703,0002,108,0002,113,536
7Oct 9, 2026 22:5510,095302,855,429150,029,0002,087,0002,113,536
8Oct 9, 2026 22:5510,115303,474,976149,176,0002,106,0002,113,536
9Oct 9, 2026 22:5510,234307,030,664154,923,0001,192,0002,113,536