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 3, 2026 16:06Victor MerckléVictor MerckléScore: 2,924Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 16:122,88886,666,111231,024,0003,081,0002,662,400stderr
2Jul 3, 2026 16:122,88986,670,084229,874,0003,088,0002,662,400stderr
3Jul 3, 2026 16:122,89686,886,087230,321,0003,195,0002,662,400stderr
4Jul 3, 2026 16:122,90987,271,179230,096,0003,177,0002,662,400stderr
5Jul 3, 2026 16:122,92487,735,339229,301,0003,022,0002,658,304stderr
6Jul 3, 2026 16:122,95488,647,296236,602,0003,090,0002,662,400stderr
7Jul 3, 2026 16:122,96088,808,443232,120,0003,092,0002,658,304stderr
8Jul 3, 2026 16:122,96588,975,087232,039,0003,071,0002,662,400stderr
9Jul 3, 2026 16:122,99789,919,798235,200,0003,086,0002,662,400stderr