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 listApr 29, 2026 13:45TudyMTudyMScore: 10,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:5110,611318,338,553863,221,00016,004,0002,707,456
2Apr 29, 2026 13:5110,637319,127,373863,612,00016,992,0002,695,168
3Apr 29, 2026 13:5110,698320,968,125864,571,00016,991,0002,703,360
4Apr 29, 2026 13:5110,731321,951,098858,855,00019,996,0002,805,760
5Apr 29, 2026 13:5110,746322,391,132865,167,00017,003,0002,781,184
6Apr 29, 2026 13:5111,219336,576,214916,783,00017,976,0002,789,376
7Apr 29, 2026 13:5111,387341,615,666918,004,00016,981,0002,686,976
8Apr 29, 2026 13:5111,459343,774,554917,732,00015,995,0002,625,536
9Apr 29, 2026 13:5111,495344,863,030913,550,00019,990,0002,805,760