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 listAug 17, 2026 06:40marko1597marko1597Score: 8,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 06:438,491254,731,067242,184,0004,248,0002,121,728stderr
2Aug 17, 2026 06:438,507255,227,520242,738,0004,172,0002,121,728stderr
3Aug 17, 2026 06:438,523255,717,691243,258,0004,161,0002,121,728stderr
4Aug 17, 2026 06:438,530255,921,207243,374,0004,242,0002,121,728stderr
5Aug 17, 2026 06:438,533256,004,828243,664,0004,173,0002,121,728stderr
6Aug 17, 2026 06:438,551256,558,299243,872,0004,168,0002,121,728stderr
7Aug 17, 2026 06:438,569257,080,588244,569,0004,316,0002,121,728stderr
8Aug 17, 2026 06:438,583257,500,188244,981,0004,123,0002,121,728stderr
9Aug 17, 2026 06:438,583257,495,397245,075,0004,139,0002,121,728stderr