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 22:33Dominique GarmierDominique GarmierScore: 8,279Success
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 22:337,970239,091,079609,497,00016,985,0002,772,992
2Mar 22, 2026 22:338,056241,686,602609,997,00016,999,0002,576,384
3Mar 22, 2026 22:338,185245,535,992615,618,00015,015,0002,711,552
4Mar 22, 2026 22:338,226246,788,386614,014,00019,000,0002,572,288
5Mar 22, 2026 22:338,279248,365,060607,986,00018,999,0002,584,576
6Mar 22, 2026 22:338,331249,944,329629,388,00018,981,0002,822,144
7Mar 22, 2026 22:338,353250,579,494630,463,00016,011,0002,662,400
8Mar 22, 2026 22:338,402252,052,846608,054,00019,001,0002,637,824
9Mar 22, 2026 22:338,458253,750,129630,587,00017,988,0002,916,352