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 22, 2026 15:50Dominique GarmierDominique GarmierScore: 8,291Success
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 15:258,126243,769,724592,750,00014,993,0002,400,256
2Mar 22, 2026 15:508,128243,844,389592,406,00015,983,0002,375,680
3Mar 22, 2026 15:258,244247,309,653595,170,00011,983,0002,375,680
4Mar 22, 2026 15:258,291248,726,237613,707,00017,991,0002,387,968
5Mar 22, 2026 15:508,394251,810,125603,871,00013,973,0002,793,472
6Mar 22, 2026 15:508,543256,299,682614,934,00016,970,0002,375,680