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 25, 2026 09:12sazsusazsuError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 09:1203,226,500,1673,074,252,000141,871,0002,117,632expected "1020123 ", got "1019596 "
2Sep 25, 2026 09:1203,224,906,7083,071,804,000142,367,0002,117,632expected "1025107 ", got "1024566 "
3Sep 25, 2026 09:1203,194,525,1223,041,817,000142,069,0002,121,728expected "1022736 ", got "1022216 "