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 listAug 2, 2026 13:33Victor MerckléVictor MerckléScore: 5,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 13:345,943178,300,597501,095,0004,318,0002,650,112stderr
2Aug 2, 2026 13:345,960178,816,240501,489,0004,559,0002,650,112stderr
3Aug 2, 2026 13:345,961178,843,618501,669,0004,719,0002,650,112stderr
4Aug 2, 2026 13:345,962178,889,342499,124,0005,620,0002,654,208stderr
5Aug 2, 2026 13:345,968179,045,984502,701,0004,585,0002,650,112stderr
6Aug 2, 2026 13:345,972179,165,574502,623,0004,698,0002,654,208stderr
7Aug 2, 2026 13:345,979179,394,775503,181,0004,321,0002,650,112stderr
8Aug 2, 2026 13:346,028180,857,302504,082,0004,545,0002,654,208stderr
9Aug 2, 2026 13:346,032180,962,852506,906,0005,546,0002,650,112stderr