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 02:44Victor MerckléVictor MerckléScore: 2,903Success
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 02:442,85085,523,251230,040,0002,026,0002,658,304
2Jun 26, 2026 02:442,87386,211,440230,736,0003,136,0002,658,304
3Jun 26, 2026 02:442,88686,604,478231,989,0003,176,0002,658,304
4Jun 26, 2026 02:442,89586,861,335232,948,0003,117,0002,658,304
5Jun 26, 2026 02:442,90387,104,584231,791,0003,125,0002,654,208
6Jun 26, 2026 02:442,90887,266,485234,030,0003,104,0002,658,304
7Jun 26, 2026 02:442,94088,208,599232,388,0003,035,0002,658,304
8Jun 26, 2026 02:442,94588,361,813231,736,0003,054,0002,658,304
9Jun 26, 2026 02:442,99789,911,004236,128,0003,041,0002,658,304