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 listMar 4, 2026 05:45olliecrowolliecrowScore: 7,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 05:456,921207,623,137518,085,0008,966,0002,387,968
2Mar 4, 2026 05:457,065211,961,888516,591,0009,992,0002,437,120
3Mar 4, 2026 05:457,091212,721,596508,789,00010,952,0002,396,160
4Mar 4, 2026 05:457,138214,149,014511,384,0009,987,0002,478,080
5Mar 4, 2026 05:457,149214,464,705511,244,0008,986,0002,379,776
6Mar 4, 2026 05:457,161214,827,384511,090,0008,984,0002,396,160
7Mar 4, 2026 05:457,170215,105,242510,541,0008,991,0002,613,248
8Mar 4, 2026 05:457,188215,650,226510,976,0009,980,0002,404,352
9Mar 4, 2026 05:457,384221,511,546509,542,0009,971,0002,568,192