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 03:37marko1597marko1597Score: 9,150Success
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 03:599,113273,395,791232,675,00032,369,0002,121,728stderr
2Aug 17, 2026 03:599,117273,521,243233,004,00032,337,0002,121,728stderr
3Aug 17, 2026 03:599,141274,243,025233,197,00032,668,0002,121,728stderr
4Aug 17, 2026 03:599,149274,484,206233,234,00032,854,0002,121,728stderr
5Aug 17, 2026 03:599,150274,510,606233,384,00032,756,0002,121,728stderr
6Aug 17, 2026 03:599,153274,610,947233,542,00032,722,0002,121,728stderr
7Aug 17, 2026 03:599,161274,853,845233,831,00032,660,0002,121,728stderr
8Aug 17, 2026 03:599,168275,059,754233,708,00032,961,0002,121,728stderr
9Aug 17, 2026 03:599,599287,992,670247,000,00032,677,0002,121,728stderr