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 listOct 31, 2026 08:04Andrew EpsteinAndrew EpsteinScore: 1,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 08:111,43142,941,25597,365,0001,181,0002,170,880stderr
2Oct 31, 2026 08:111,45843,760,97199,453,0001,185,0002,170,880stderr
3Oct 31, 2026 08:111,47044,128,208101,277,0001,120,0002,170,880stderr
4Oct 31, 2026 08:111,48244,478,481101,591,0001,206,0002,170,880stderr
5Oct 31, 2026 08:111,48344,492,033102,055,0001,097,0002,170,880stderr
6Oct 31, 2026 08:111,48444,538,995102,329,0001,111,0002,170,880stderr
7Oct 31, 2026 08:111,48644,598,556102,292,0001,112,0002,170,880stderr
8Oct 31, 2026 08:111,48744,634,522102,249,0001,149,0002,170,880stderr
9Oct 31, 2026 08:111,48944,691,663102,328,0001,021,0002,170,880stderr