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 15:53Shikhar SoniShikhar SoniScore: 76,972Success
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 15:5476,5222,295,670,5632,243,984,00040,725,0002,117,632
2Jun 26, 2026 15:5476,5602,296,824,1492,245,493,00040,292,0002,117,632
3Jun 26, 2026 15:5476,7792,303,381,6892,252,334,00040,336,0002,117,632
4Jun 26, 2026 15:5476,9332,307,993,3322,256,639,00040,316,0002,117,632
5Jun 26, 2026 15:5476,9722,309,186,3732,257,626,00040,504,0002,117,632
6Jun 26, 2026 15:5476,9842,309,527,8472,257,783,00040,797,0002,117,632
7Jun 26, 2026 15:5477,0902,312,722,4572,261,648,00040,188,0002,117,632
8Jun 26, 2026 15:5477,2202,316,611,1592,265,448,00040,368,0002,117,632
9Jun 26, 2026 15:5477,2202,316,615,2142,265,084,00040,427,0002,117,632