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 15, 2026 01:24Josu San MartinJosu San MartinScore: 4,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 01:264,676140,302,663194,362,0004,136,0002,142,208
2Sep 15, 2026 01:264,676140,307,701196,208,0003,116,0002,142,208
3Sep 15, 2026 01:264,682140,469,969194,170,0004,155,0002,142,208
4Sep 15, 2026 01:264,683140,507,434194,423,0004,181,0002,142,208
5Sep 15, 2026 01:264,687140,624,125195,010,0004,145,0002,142,208
6Sep 15, 2026 01:264,691140,754,762194,868,0004,170,0002,142,208
7Sep 15, 2026 01:264,710141,312,823195,211,0004,157,0002,142,208
8Sep 15, 2026 01:264,725141,765,331197,414,0004,150,0002,142,208
9Sep 15, 2026 01:264,736142,090,906197,677,0004,360,0002,142,208