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 05:26Andrew EpsteinAndrew EpsteinScore: 1,586Success
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 05:341,52445,746,12699,298,0002,007,0002,174,976stderr
2Oct 31, 2026 05:341,54346,305,140100,890,0002,008,0002,179,072stderr
3Oct 31, 2026 05:341,57447,229,366103,615,0002,026,0002,179,072stderr
4Oct 31, 2026 05:341,57947,380,520103,751,0002,007,0002,220,032stderr
5Oct 31, 2026 05:341,58647,601,211104,773,0002,019,0002,174,976stderr
6Oct 31, 2026 05:341,59447,824,768105,113,0002,116,0002,174,976stderr
7Oct 31, 2026 05:341,61648,495,234103,022,0002,041,0002,220,032stderr
8Oct 31, 2026 05:341,64349,300,789104,898,0002,032,0002,174,976stderr
9Oct 31, 2026 05:342,11463,448,201115,935,0002,089,0002,174,976stderr