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 31, 2026 06:19Andrew EpsteinAndrew EpsteinScore: 1,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 06:201,43743,122,54298,003,0001,117,0002,170,880stderr
2Oct 31, 2026 06:201,45343,609,88499,101,0001,248,0002,170,880stderr
3Oct 31, 2026 06:201,46944,084,299100,536,0001,267,0002,174,976stderr
4Oct 31, 2026 06:201,47144,146,425100,681,0001,190,0002,170,880stderr
5Oct 31, 2026 06:201,47444,237,921100,682,0001,251,0002,170,880stderr
6Oct 31, 2026 06:201,48144,454,175102,034,0001,129,0002,170,880stderr
7Oct 31, 2026 06:201,48944,672,919102,277,0001,010,0002,170,880stderr
8Oct 31, 2026 06:201,49044,714,065102,439,0001,204,0002,162,688stderr
9Oct 31, 2026 06:201,50845,246,812104,043,0001,244,0002,170,880stderr