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 listNov 21, 2025 03:15izotoffizotoffScore: 28,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2025 03:1528,049841,458,452810,700,0004,998,0002,756,608
2Nov 21, 2025 03:1528,246847,394,934814,507,0005,996,0002,691,072
3Nov 21, 2025 03:1528,407852,198,800813,215,0008,991,0002,764,800
4Nov 21, 2025 03:1528,708861,237,201825,149,0006,001,0002,625,536
5Nov 21, 2025 03:1528,761862,833,499834,778,0004,998,0002,654,208
6Nov 21, 2025 03:1528,801864,021,858832,018,0006,000,0002,711,552
7Nov 21, 2025 03:1528,805864,161,204829,137,0005,000,0002,560,000
8Nov 21, 2025 03:1530,391911,730,655880,554,0006,996,0002,691,072
9Nov 21, 2025 03:1530,573917,190,914879,215,0009,991,0002,756,608