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 20, 2026 20:52janwwwjanwwwScore: 5,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 20:545,077152,317,753405,342,0004,322,0002,166,784
2Oct 20, 2026 20:545,078152,359,656404,804,0004,115,0002,166,784
3Oct 20, 2026 20:545,086152,589,586404,785,0004,255,0002,166,784
4Oct 20, 2026 20:545,125153,773,352406,277,0004,172,0002,166,784
5Oct 20, 2026 20:545,139154,197,506407,972,0004,284,0002,166,784
6Oct 20, 2026 20:545,142154,279,764408,424,0004,330,0002,166,784
7Oct 20, 2026 20:545,155154,673,933406,306,0004,154,0002,166,784
8Oct 20, 2026 20:545,160154,810,623409,593,0004,166,0002,166,784
9Oct 20, 2026 20:545,196155,888,089407,164,0004,312,0002,166,784