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 14, 2026 19:17Dominique GarmierDominique GarmierScore: 41,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 23:1540,5921,217,767,9953,500,972,00030,982,0002,805,760
2Mar 14, 2026 23:1541,0361,231,069,5043,542,989,00030,973,0002,789,376
3Mar 14, 2026 23:1541,2021,236,054,1843,535,124,00032,982,0002,412,544
4Mar 14, 2026 19:1741,6141,248,408,1603,592,273,00033,955,0002,568,192
5Mar 14, 2026 19:1741,7221,251,669,2553,594,208,00038,948,0002,383,872
6Mar 14, 2026 19:1741,7281,251,835,1073,604,768,00030,963,0002,822,144