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 24, 2026 02:37Victor MerckléVictor MerckléScore: 3,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 02:383,07392,214,468242,367,0001,010,0002,658,304stderr
2Jun 24, 2026 02:383,09192,758,560240,728,0003,088,0002,658,304stderr
3Jun 24, 2026 02:383,09392,792,591241,197,0003,387,0002,658,304stderr
4Jun 24, 2026 02:383,09592,867,452241,726,0003,099,0002,658,304stderr
5Jun 24, 2026 02:383,10093,020,890242,848,0003,185,0002,408,448stderr
6Jun 24, 2026 02:383,12093,621,034241,636,0003,117,0002,654,208stderr
7Jun 24, 2026 02:383,12193,649,920242,054,0003,077,0002,658,304stderr
8Jun 24, 2026 02:383,12193,657,946243,980,0003,168,0002,658,304stderr
9Jun 24, 2026 02:383,20896,245,566247,242,0003,100,0002,658,304stderr