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 15:10A_ShamanA_ShamanScore: 88,699Success
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 15:1288,2112,646,346,6392,583,404,00049,346,0002,121,728
2Jul 3, 2026 15:1288,6202,658,607,2342,595,586,00050,081,0002,121,728
3Jul 3, 2026 15:1288,6662,659,994,0432,596,402,00049,457,0002,121,728
4Jul 3, 2026 15:1288,6962,660,902,5152,598,302,00048,660,0002,121,728
5Jul 3, 2026 15:1288,6992,660,973,5282,597,341,00050,356,0002,121,728
6Jul 3, 2026 15:1289,0902,672,724,0382,608,540,00050,271,0002,121,728
7Jul 3, 2026 15:1289,1912,675,750,4762,612,032,00049,621,0002,121,728
8Jul 3, 2026 15:1289,2292,676,880,8222,612,827,00049,827,0002,121,728
9Jul 3, 2026 15:1289,3992,681,998,2762,618,135,00050,327,0002,121,728