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:33A_ShamanA_ShamanScore: 88,437Success
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:3487,6432,629,292,9872,568,152,00050,987,0002,113,536
2Jul 3, 2026 14:3488,2422,647,278,4522,585,207,00051,692,0002,113,536
3Jul 3, 2026 14:3488,3012,649,058,4512,587,563,00051,419,0002,117,632
4Jul 3, 2026 14:3488,3182,649,551,9602,588,663,00051,042,0002,113,536
5Jul 3, 2026 14:3488,4372,653,125,1932,591,868,00051,166,0002,113,536
6Jul 3, 2026 14:3488,5862,657,580,9862,596,358,00051,073,0002,117,632
7Jul 3, 2026 14:3488,9292,667,887,9612,607,035,00051,149,0002,117,632
8Jul 3, 2026 14:3489,1202,673,600,0092,612,193,00051,451,0002,113,536
9Jul 3, 2026 14:3489,1862,675,596,4632,613,336,00051,718,0002,113,536