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 14:13TudyMTudyMScore: 11,217Success
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:1311,086332,600,708896,292,00013,988,0002,789,376
2Apr 29, 2026 14:1311,144334,332,579896,577,00020,990,0002,871,296
3Apr 29, 2026 14:1311,183335,519,890892,057,00019,978,0002,748,416
4Apr 29, 2026 14:1311,207336,238,639902,949,00014,982,0002,797,568
5Apr 29, 2026 14:1311,217336,535,741902,546,00013,992,0002,797,568
6Apr 29, 2026 14:1311,637349,117,343952,147,00013,002,0002,781,184
7Apr 29, 2026 14:1311,642349,272,087948,603,00020,012,0002,842,624
8Apr 29, 2026 14:1311,727351,839,866951,344,00015,988,0002,736,128
9Apr 29, 2026 14:1311,750352,510,202947,370,00019,986,0002,670,592