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:34marko1597marko1597Score: 8,317Success
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:368,291248,759,153236,396,0004,123,0002,121,728stderr
2Aug 17, 2026 06:368,307249,235,942236,615,0004,287,0002,121,728stderr
3Aug 17, 2026 06:368,308249,240,798236,719,0004,149,0002,121,728stderr
4Aug 17, 2026 06:368,315249,456,514236,897,0004,295,0002,121,728stderr
5Aug 17, 2026 06:368,317249,529,033237,226,0004,172,0002,121,728stderr
6Aug 17, 2026 06:368,320249,621,407236,423,0004,302,0002,121,728stderr
7Aug 17, 2026 06:368,328249,845,906237,352,0004,164,0002,121,728stderr
8Aug 17, 2026 06:368,351250,533,131236,659,0004,184,0002,121,728stderr
9Aug 17, 2026 06:368,368251,057,466238,573,0004,211,0002,121,728stderr