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:22marko1597marko1597Score: 8,597Success
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:338,527255,839,299241,057,0006,371,0002,121,728stderr
2Aug 17, 2026 06:338,578257,345,594242,945,0006,198,0002,121,728stderr
3Aug 17, 2026 06:338,587257,621,801243,065,0006,366,0002,121,728stderr
4Aug 17, 2026 06:338,596257,884,040243,281,0006,275,0002,121,728stderr
5Aug 17, 2026 06:338,597257,915,792243,448,0006,197,0002,121,728stderr
6Aug 17, 2026 06:338,615258,476,442243,796,0006,399,0002,121,728stderr
7Aug 17, 2026 06:338,658259,759,685244,942,0006,428,0002,121,728stderr
8Aug 17, 2026 06:338,800264,007,465249,448,0006,218,0002,121,728stderr
9Aug 17, 2026 06:338,804264,131,339249,499,0006,236,0002,121,728stderr