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 27, 2026 12:59Victor MerckléVictor MerckléScore: 2,890Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 13:002,86886,066,769230,676,0003,068,0002,654,208
2Jun 27, 2026 13:002,87586,278,262231,161,0003,105,0002,658,304
3Jun 27, 2026 13:002,88186,447,260231,684,0003,090,0002,654,208
4Jun 27, 2026 13:002,89086,709,864232,579,0003,061,0002,658,304
5Jun 27, 2026 13:002,89086,705,123232,158,0003,077,0002,658,304
6Jun 27, 2026 13:002,89486,820,568233,799,0002,126,0002,658,304
7Jun 27, 2026 13:002,89586,864,033232,630,0003,116,0002,658,304
8Jun 27, 2026 13:002,95188,558,022234,960,0002,056,0002,658,304
9Jun 27, 2026 13:002,98389,511,736237,595,0002,177,0002,658,304