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 04:04marko1597marko1597Score: 9,964Success
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 04:369,940298,217,359285,535,0004,334,0002,121,728stderr
2Aug 17, 2026 04:369,941298,247,751285,845,0004,247,0002,121,728stderr
3Aug 17, 2026 04:369,952298,585,468286,061,0004,280,0002,121,728stderr
4Aug 17, 2026 04:369,961298,848,396285,995,0004,418,0002,121,728stderr
5Aug 17, 2026 04:369,964298,923,479286,383,0004,301,0002,121,728stderr
6Aug 17, 2026 04:369,967299,018,801286,287,0004,391,0002,121,728stderr
7Aug 17, 2026 04:3610,018300,568,060287,172,0004,286,0002,121,728stderr
8Aug 17, 2026 04:3610,055301,673,981289,017,0004,311,0002,121,728stderr
9Aug 17, 2026 04:3610,069302,080,045289,442,0004,357,0002,121,728stderr