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 22, 2026 17:17Dominique GarmierDominique GarmierScore: 76,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 20:1575,3912,261,739,3462,226,722,00010,998,0002,412,544
2Mar 22, 2026 19:3975,5122,265,361,4432,226,241,00014,994,0002,592,768
3Mar 22, 2026 19:3975,9272,277,821,7842,238,625,00012,997,0002,363,392
4Mar 22, 2026 19:3976,0222,280,663,7532,236,097,00015,000,0002,396,160
5Mar 22, 2026 20:1576,4812,294,438,0652,259,560,00011,002,0002,568,192
6Mar 22, 2026 20:1576,7432,302,298,3132,252,183,00015,987,0002,400,256
7Mar 22, 2026 17:1776,7562,302,676,0882,270,094,00011,995,0002,637,824
8Mar 22, 2026 17:1777,7142,331,411,8722,285,693,00014,004,0002,379,776
9Mar 22, 2026 17:1778,0032,340,075,5522,301,537,00016,989,0002,404,352