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 listJul 3, 2026 14:45A_ShamanA_ShamanScore: 88,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 14:4687,8742,636,241,7672,584,401,00041,755,0002,113,536
2Jul 3, 2026 14:4687,9022,637,061,7262,585,867,00041,520,0002,117,632
3Jul 3, 2026 14:4688,0662,641,990,4322,590,000,00041,771,0002,117,632
4Jul 3, 2026 14:4688,4062,652,209,1282,600,810,00041,652,0002,113,536
5Jul 3, 2026 14:4688,4892,654,672,3012,603,030,00041,560,0002,117,632
6Jul 3, 2026 14:4688,6192,658,581,7412,607,202,00041,531,0002,113,536
7Jul 3, 2026 14:4688,6592,659,778,8122,608,081,00041,600,0002,117,632
8Jul 3, 2026 14:4689,2122,676,383,5412,624,409,00041,778,0002,113,536
9Jul 3, 2026 14:4689,3362,680,093,3612,628,921,00041,496,0002,117,632