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 listSep 19, 2026 13:28Andrew EpsteinAndrew EpsteinScore: 7,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 13:557,110213,318,139574,445,00018,108,0002,387,968stderr
2Sep 19, 2026 13:557,308219,254,647574,538,00018,260,0002,490,368stderr
3Sep 19, 2026 13:557,321219,659,476590,983,00018,387,0002,215,936stderr
4Sep 19, 2026 13:557,339220,176,772587,884,00017,905,0002,310,144stderr
5Sep 19, 2026 13:557,471224,149,956587,208,00017,500,0002,527,232stderr
6Sep 19, 2026 13:557,489224,694,541583,028,00018,383,0002,387,968stderr
7Sep 19, 2026 13:557,494224,822,585576,484,00017,402,0002,400,256stderr
8Sep 19, 2026 13:557,529225,878,393585,566,00019,209,0002,506,752stderr
9Sep 19, 2026 13:557,710231,322,628592,429,00018,057,0002,469,888stderr