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,712Success
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:428,683260,509,612248,045,0004,157,0002,121,728stderr
2Aug 17, 2026 06:428,691260,754,242248,433,0004,171,0002,121,728stderr
3Aug 17, 2026 06:428,695260,859,971248,320,0004,202,0002,121,728stderr
4Aug 17, 2026 06:428,710261,328,159248,717,0004,277,0002,121,728stderr
5Aug 17, 2026 06:428,712261,370,860248,865,0004,157,0002,121,728stderr
6Aug 17, 2026 06:428,727261,826,146249,364,0004,126,0002,121,728stderr
7Aug 17, 2026 06:428,734262,047,660248,240,0004,139,0002,121,728stderr
8Aug 17, 2026 06:428,750262,504,402248,269,0005,147,0002,121,728stderr
9Aug 17, 2026 06:428,887266,622,035253,980,0004,282,0002,121,728stderr