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 4, 2026 08:03olliecrowolliecrowScore: 7,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 08:036,975209,256,450511,308,00010,985,0002,662,400
2Mar 4, 2026 08:036,977209,305,853511,470,0009,970,0002,666,496
3Mar 4, 2026 08:036,991209,731,386512,032,00010,020,0002,617,344
4Mar 4, 2026 08:037,034211,031,921514,122,0008,967,0002,387,968
5Mar 4, 2026 08:037,086212,568,195519,061,0009,981,0002,387,968
6Mar 4, 2026 08:037,294218,818,142513,047,0009,981,0002,363,392
7Mar 4, 2026 08:037,394221,834,035516,872,0009,978,0002,568,192
8Mar 4, 2026 08:037,425222,741,433509,982,0009,980,0002,670,592
9Mar 4, 2026 08:037,427222,822,069517,140,0008,967,0002,486,272