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 listMar 25, 2026 02:57Dominique GarmierDominique GarmierScore: 107,898Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 19:02106,9963,209,893,1833,165,774,0009,983,0002,547,712
2Mar 22, 2026 19:02107,3473,220,420,7613,179,697,0009,989,0002,572,288
3Mar 22, 2026 19:02107,7003,231,008,2503,193,537,0007,993,0002,719,744
4Mar 25, 2026 02:57107,8983,236,935,2553,196,374,0005,995,0002,764,800
5Mar 25, 2026 02:57108,3833,251,490,7973,214,576,0003,995,0002,707,456
6Mar 25, 2026 02:57109,2593,277,767,9653,239,558,0008,990,0002,551,808