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 listOct 9, 2026 23:21janwwwjanwwwScore: 24,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 23:2324,241727,235,731212,028,0002,204,0002,117,632
2Oct 9, 2026 23:2324,241727,233,955215,908,0002,183,0002,117,632
3Oct 9, 2026 23:2324,242727,262,176215,649,0002,194,0002,117,632
4Oct 9, 2026 23:2324,242727,273,040214,008,0002,170,0002,117,632
5Oct 9, 2026 23:2324,242727,268,525214,825,0002,168,0002,117,632
6Oct 9, 2026 23:2324,245727,375,028213,315,0002,089,0002,117,632
7Oct 9, 2026 23:2324,245727,362,692213,314,0002,082,0002,117,632
8Oct 9, 2026 23:2324,246727,392,197211,321,0002,228,0002,117,632
9Oct 9, 2026 23:2324,247727,428,402213,016,0002,187,0002,117,632