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 13, 2026 16:19Yehor BondarYehor BondarScore: 114,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 16:20114,5083,435,265,3803,367,135,00055,750,0002,113,536
2Aug 13, 2026 16:20114,5093,435,273,6653,367,840,00055,160,0002,113,536
3Aug 13, 2026 16:20114,5193,435,585,9233,367,971,00055,391,0002,113,536
4Aug 13, 2026 16:20114,5203,435,604,5833,367,711,00055,497,0002,113,536
5Aug 13, 2026 16:20114,5393,436,181,1863,369,085,00054,863,0002,113,536
6Aug 13, 2026 16:20114,5593,436,777,5693,369,385,00055,253,0002,113,536
7Aug 13, 2026 16:20114,5653,436,960,1413,369,807,00054,872,0002,113,536
8Aug 13, 2026 16:20114,6043,438,137,8983,370,236,00055,609,0002,113,536
9Aug 13, 2026 16:20114,6973,440,923,0203,372,895,00055,720,0002,113,536