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 26, 2026 17:02Shikhar SoniShikhar SoniScore: 41,816Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 17:0341,7561,252,704,4491,211,063,00031,362,0002,113,536
2Jun 26, 2026 17:0341,7631,252,911,8331,211,208,00031,379,0002,113,536
3Jun 26, 2026 17:0341,7651,252,957,5641,214,239,00028,637,0002,113,536
4Jun 26, 2026 17:0341,7991,253,990,7331,211,234,00030,901,0002,113,536
5Jun 26, 2026 17:0341,8161,254,480,5491,215,657,00028,584,0002,113,536
6Jun 26, 2026 17:0341,8251,254,766,2981,212,336,00031,705,0002,113,536
7Jun 26, 2026 17:0342,0531,261,595,6961,219,790,00031,510,0002,113,536
8Jun 26, 2026 17:0342,0791,262,379,8051,221,008,00031,128,0002,113,536
9Jun 26, 2026 17:0342,3551,270,655,9831,229,114,00030,931,0002,113,536