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:53TudyMTudyMScore: 12,712Success
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 14:0110,722321,664,964863,420,00014,989,0002,711,552
2Apr 29, 2026 14:0110,742322,273,598868,295,00012,004,0002,768,896
3Apr 29, 2026 14:0111,199335,970,446917,658,00017,973,0002,650,112
4Apr 29, 2026 14:0112,522375,673,302983,877,00012,803,0002,314,240
5Apr 29, 2026 14:0112,712381,386,676946,019,00014,968,0002,330,624
6Apr 29, 2026 14:0113,665409,977,804966,771,00038,200,0002,314,240
7Apr 29, 2026 14:0114,250427,512,958983,421,00040,533,0002,322,432
8Apr 29, 2026 14:0115,761472,859,590984,471,00011,932,0002,396,160
9Apr 29, 2026 14:0116,079482,383,401963,608,00013,936,0002,338,816