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 listSep 8, 2026 16:33C#_userC#_userError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 16:34016,016,684,99815,912,974,00092,683,0002,113,536expected "1024891 ", got "1024892 "
2Sep 8, 2026 16:34016,146,193,87516,043,064,00091,979,0002,113,536expected "1023599 ", got "1023600 "
3Sep 8, 2026 16:34016,008,464,21915,902,340,00094,938,0002,113,536expected "1023512 ", got "1023513 "