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:36C#_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:40016,199,777,75016,096,450,00092,127,0002,113,536expected "1025632 ", got "1025634 "
2Sep 8, 2026 16:40016,047,020,55615,941,301,00094,436,0002,113,536expected "1022665 ", got "1022667 "
3Sep 8, 2026 16:40016,033,178,70315,929,835,00092,243,0002,113,536expected "1019347 ", got "1019349 "