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 listApr 27, 2026 22:34TudyMTudyMScore: 11,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:4410,754322,647,998873,627,00017,971,0002,613,248
2Apr 27, 2026 22:4410,762322,880,404868,943,00016,979,0002,711,552
3Apr 27, 2026 22:4410,841325,246,634883,360,00017,986,0002,822,144
4Apr 27, 2026 22:4411,313339,419,556923,369,00019,986,0002,711,552
5Apr 27, 2026 22:4411,367341,011,088924,512,00018,969,0002,772,992
6Apr 27, 2026 22:4411,396341,889,617925,933,00017,998,0002,740,224
7Apr 27, 2026 22:4411,411342,339,123930,583,00013,993,0002,621,440
8Apr 27, 2026 22:4411,433343,007,519928,158,00017,983,0002,662,400
9Apr 27, 2026 22:4411,456343,684,926925,080,00018,981,0002,736,128