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 listJun 30, 2026 01:42Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 01:44091,614,413235,197,0003,326,0002,707,456expected "1019054 ", got "1019053 "
2Jun 30, 2026 01:442,97589,261,653229,430,0003,330,0002,707,456
3Jun 30, 2026 01:442,98689,593,877231,659,0003,242,0002,703,360
4Jun 30, 2026 01:442,99389,796,244232,078,0003,296,0002,707,456
5Jun 30, 2026 01:442,99389,795,784231,791,0003,343,0002,707,456
6Jun 30, 2026 01:443,03791,116,052236,991,0003,144,0002,707,456
7Jun 30, 2026 01:443,07492,236,351234,035,0004,396,0002,707,456
8Jun 30, 2026 01:443,11793,534,365236,421,0003,289,0002,703,360
9Jun 30, 2026 01:443,13994,198,724237,858,0003,226,0002,703,360