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 listJul 26, 2026 20:57Andrew TsibinAndrew TsibinScore: 22,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2026 20:5822,118663,561,907645,074,0007,749,0002,138,112
2Jul 26, 2026 20:5822,119663,586,881646,597,0006,449,0002,138,112
3Jul 26, 2026 20:5822,147664,435,717647,359,0006,549,0002,138,112
4Jul 26, 2026 20:5822,147664,439,559646,414,0006,790,0002,138,112
5Jul 26, 2026 20:5822,175665,265,376647,447,0006,550,0002,138,112
6Jul 26, 2026 20:5822,182665,467,297647,527,0006,695,0002,138,112
7Jul 26, 2026 20:5822,193665,815,715648,586,0006,639,0002,138,112
8Jul 26, 2026 20:5822,215666,452,191649,212,0006,620,0002,138,112
9Jul 26, 2026 20:5822,411672,350,717655,296,0006,608,0002,117,632